Storing the subdivision of a polyhedral surface
SCG '86 Proceedings of the second annual symposium on Computational geometry
Linear data structures for two types of range search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
SCG '87 Proceedings of the third annual symposium on Computational geometry
Establishing order in planar subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
Optimal parallel algorithms for transitive closure and point location in planar structures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Arrangements of lines in 3-space: a data structure with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A fast planar partition algorithm, II
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Compliant motion in a simple polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Bounded diameter minimum spanning trees and related problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics (TOG)
Optimal cooperative search in fractional cascaded data structures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Polygon triangulation in O(n log log n) time with simple data-structures
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
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
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
Locating a robot with angle measurements
Journal of Symbolic Computation
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation
A fast planar partition algorithm, II
Journal of the ACM (JACM)
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamization of the trapezoid method for planar point location (extended abstract)
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)
The robot localization problem in two dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An Onlognloglogn algorithm for the on-line closest pair problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Manhattonian proximity in a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Moving a disc between polygons
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
An implementation for maintaining arrangements of polygons
Proceedings of the eleventh annual symposium on Computational geometry
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Simple traversal of a subdivision without extra storage
Proceedings of the twelfth annual symposium on Computational geometry
Fitting a set of points by a circle
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Storing a collection of polygons using quadtrees
ACM Transactions on Graphics (TOG)
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Spanning trees crossing few barriers
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth 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
Practical methods for approximating shortest paths on a convex polytope in R3
Proceedings of the sixth 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
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the exact worst case query complexity of planar point location
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying parallel processing techniques to classification problems in constructive solid geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Rectilinear shortest paths with rectangular barriers
SCG '85 Proceedings of the first 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
Computing approximate shortest paths on convex polytopes
Proceedings of the sixteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Entropy-preserving cuttings and space-efficient planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple entropy-based algorithm for planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Systolic Algorithm for the k-Nearest Neighbors Problem
IEEE Transactions on Computers
On Computing Connected Components of Line Segments
IEEE Transactions on Computers
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient Expected-Case Algorithms for Planar Point Location
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Improved Algorithm for Subdivision Traversal without Extra Storage
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Facility Location Constrained to a Polygonal Domain
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Planar Point Location for Large Data Sets: To Seek or Not to Seek
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Approximation algorithms for projective clustering
Journal of Algorithms
An efficient k nearest neighbors searching algorithm for a query line
Theoretical Computer Science
Planar point location for large data sets: to seek or not to seek
Journal of Experimental Algorithmics (JEA)
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
Tight bounds for connecting sites across barriers
Proceedings of the twenty-second annual symposium on Computational geometry
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms (TALG)
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distribution-sensitive point location in convex subdivisions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fast computation of smallest enclosing circle with center on a query line segment
Information Processing Letters
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Spatial aggregation: Data model and implementation
Information Systems
Compressing spatio-temporal trajectories
Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Technical Section: Collision detection using polar diagrams
Computers and Graphics
Farthest-polygon Voronoi diagrams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Farthest-polygon Voronoi diagrams
Computational Geometry: Theory and Applications
(Approximate) uncertain skylines
Proceedings of the 14th International Conference on Database Theory
Improved algorithms for farthest colored voronoi diagram of segments
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Covering a set of points with a minimum number of lines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Data structures for halfplane proximity queries and incremental voronoi diagrams
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms (TALG)
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
Computational Geometry: Theory and Applications
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Higher order city voronoi diagrams
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Improved implementation of point location in general two-dimensional subdivisions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Multi-level association rules and directed graphs for spatial data analysis
Expert Systems with Applications: An International Journal
Improved algorithms for the farthest colored Voronoi diagram of segments
Theoretical Computer Science
Offset polygon and annulus placement problems
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |