Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A fast Las Vegas algorithm for triangulating a simple polygon
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient parallel computation of arrangements of hyperplanes in d dimensions
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Points and triangles in the plane and halving planes in space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic point location in arrangements of hyperplanes
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized parallel algorithms for trapezoidal diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On the sum of squares of cell complexities in hyperplane arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Computing a face in an arrangement of line segments
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing the antipenumbra of an area light source
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Tail estimates for the space complexity of randomized incremental algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A deterministic algorithm for the three-dimensional diameter problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Almost tight upper bounds for the single cell and zone problems in three dimensions
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On translational motion planning in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing many faces in arrangements of lines and segments
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On lazy randomized incremental construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
ACM SIGACT News
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Proceedings of the eleventh annual symposium on Computational geometry
The Voronoi diagram of curved objects
Proceedings of the eleventh annual symposium on Computational geometry
The overlay of lower envelopes in three dimensions and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Rounding arrangements dynamically
Proceedings of the eleventh annual symposium on Computational geometry
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
How to cut pseudo-parabolas into segments
Proceedings of the eleventh annual symposium on Computational geometry
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Temporally coherent conservative visibility (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Results on k-sets and j-facets via continuous motion
Proceedings of the fourteenth annual symposium on Computational geometry
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Geometric algorithms for trap design
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Pipes, cigars, and kreplach: the union of Minkowski sums in three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for terrain simplification
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Line transversals of balls and smallest enclosing cylinders in three dimensions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Random sampling in geometric optimization: new insights and applications
Proceedings of the sixteenth annual symposium on Computational geometry
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for layered manufacturing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixth ACM symposium on Solid modeling and applications
The union of congruent cubes in three dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The Clarkson-Shor technique revisited and extended
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations
Proceedings of the eighteenth annual symposium on Computational geometry
On the overlay of envelopes in four dimensions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Structure Theorems for Systems of Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Quantum Algorithms for Intersection and Proximity Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Computing Farthest Neighbors on a Convex Polytope
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Applications of the Generic Programming Paradigm in the Design of CGAL
Selected Papers from the International Seminar on Generic Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Splitting a Delaunay Triangulation in Linear Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Computing the Diameter of a Point Set
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Distribution-sensitive algorithms
Nordic Journal of Computing
Computing farthest neighbors on a convex polytope
Theoretical Computer Science - Computing and combinatorics
Proceedings of the nineteenth annual symposium on Computational geometry
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
Proceedings of the nineteenth annual symposium on Computational geometry
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry
Updating and constructing constrained delaunay and constrained regular triangulations by flips
Proceedings of the nineteenth annual symposium on Computational geometry
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
Handbook of massive data sets
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Toward Spatial Joins for Polygons
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Journal of Computer and System Sciences - Special issue on PODS 2000
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
Journal of Functional Programming
The Clarkson–Shor Technique Revisited and Extended
Combinatorics, Probability and Computing
Information Processing Letters
Abstract Voronoi diagram in 3-space
Journal of Computer and System Sciences
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithm 833: CSRFPACK---interpolation of scattered data with a C1 convexity-preserving surface
ACM Transactions on Mathematical Software (TOMS)
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Almost tight upper bounds for vertical decompositions in four dimensions
Journal of the ACM (JACM)
Almost tight bound for a single cell in an arrangement of convex polyhedra in R3
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Controlled perturbation for Delaunay triangulations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory Series A
On the chromatic number of some geometric hypergraphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Conflict-free colorings of shallow discs
Proceedings of the twenty-second annual symposium on Computational geometry
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
A New Active Convex Hull Model for Image Regions
Journal of Mathematical Imaging and Vision
Three problems about simple polygons
Computational Geometry: Theory and Applications
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
The voronoi diagram of three lines
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On approximate range counting and depth
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Dynamic connectivity for axis-parallel rectangles
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Classroom examples of robustness problems in geometric computations
Computational Geometry: Theory and Applications
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
On levels in arrangements of curves, iii: further improvements
Proceedings of the twenty-fourth annual symposium on Computational geometry
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
Learning all optimal policies with multiple criteria
Proceedings of the 25th international conference on Machine learning
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
On a question of bourgain about geometric incidences
Combinatorics, Probability and Computing
Reliable Implementation of Real Number Algorithms: Theory and Practice
On Center Regions and Balls Containing Many Points
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Robust Kinetic Convex Hulls in 3D
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
Depth of segments and circles through points enclosing many points: a note
Computational Geometry: Theory and Applications
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Line transversals of convex polyhedra in R3
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
All Farthest Neighbors in the Presence of Highways and Obstacles
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Higher-order Voronoi diagrams on triangulated surfaces
Information Processing Letters
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Parallel geometric algorithms for multi-core computers
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Abstract Voronoi diagrams revisited
Computational Geometry: Theory and Applications
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Three problems about simple polygons
Computational Geometry: Theory and Applications
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Geometric streaming algorithms with a sorting primitive
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the twenty-sixth annual symposium on Computational geometry
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Parallel geometric algorithms for multi-core computers
Computational Geometry: Theory and Applications
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Data-specific analysis of string sorting
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Self-improving algorithms for convex hulls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
A kinetic triangulation scheme for moving points in the plane
Computational Geometry: Theory and Applications
Synthesizing concurrent schedulers for irregular algorithms
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing
Distance between separating circles and points
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
A pedagogic JavaScript program for point location strategies
Proceedings of the twenty-seventh annual symposium on Computational geometry
Answer-pairs and processing of continuous nearest-neighbor queries
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Computational Geometry: Theory and Applications
Spatial skyline queries: exact and approximation algorithms
Geoinformatica
An output-sensitive approach for the L1/L∞k-nearest-neighbor Voronoi diagram
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximation algorithms for speeding up dynamic programming and denoising aCGH data
Journal of Experimental Algorithmics (JEA)
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
SIAM Journal on Computing
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Overlaying multiple maps efficiently
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Polyline fitting of planar points under min-sum criteria
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Geometric optimization problems over sliding windows
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Superimposing voronoi complexes for shape deformation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Covering many or few points with unit disks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Lower bounds for geometric diameter problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Every graph admits an unambiguous bold drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Applications of Geometry Processing: CudaHull: Fast parallel 3D convex hull on the GPU
Computers and Graphics
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
Proceedings of the twenty-eighth annual symposium on Computational geometry
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Computer Science Review
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
Improved Bounds for Geometric Permutations
SIAM Journal on Computing
Range searching on uncertain data
ACM Transactions on Algorithms (TALG)
A review on delaunay refinement techniques
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Computational Geometry: Theory and Applications
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
Union of random minkowski sums and network vulnerability analysis
Proceedings of the twenty-ninth annual symposium on Computational geometry
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Topological relations between separating circles
Discrete Applied Mathematics
Deterministic galois: on-demand, portable and parameterless
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
Interactive surface decomposition for polyhedral morphing
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |