Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Linear programming in O(n × 3d2) time
Information Processing Letters
Searching and sorting similar lists
Journal of Algorithms
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Scene analysis and geometric homology
SCG '86 Proceedings of the second annual symposium on Computational geometry
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Voronoi diagrams and arrangements
Discrete & Computational Geometry
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Filtering search: a new approach to query answering
SIAM Journal on Computing
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Reducing multiple object motion planning to graph searching
SIAM Journal on Computing
On approximations and incidence in cylindrical algebraic decompositions
SIAM Journal on Computing
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On k-hulls and related problems
SIAM Journal on Computing
Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Art gallery theorems and algorithms
Art gallery theorems and algorithms
An O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
The complexity of robot motion planning
The complexity of robot motion planning
The complexity of linear problems in fields
Journal of Symbolic Computation
Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Abstract Voronoi diagrams and their applications (extended abstract)
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A geometric approach to error detection and recovery for robot motion planning with uncertainty
Artificial Intelligence - Special issue on geometric reasoning
Verifiable implementation of geometric algorithms using finite precision arithmetic
Artificial Intelligence - Special issue on geometric reasoning
A randomized algorithm for closest-point queries
SIAM Journal on Computing
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Space-time trade-offs for orthogonal range queries
SIAM Journal on Computing
An optimal-time algorithm for slope selection
SIAM Journal on Computing
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Recipes for geometry and numerical analysis - Part I: an empirical study
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Kink-free deformations of polygons
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
On the representation and manipulation of rigid solids
On the representation and manipulation of rigid solids
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry - Special issue on the complexity of arrangements
The complexity of many cells in arrangements of planes and related problems
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Generalised characteristic polynomials
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
A solid modelling system free from topological inconsistency
Journal of Information Processing
A randomized algorithm for fixed-dimensional linear programming
Mathematical Programming: Series A and B
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
A fast Las Vegas algorithm for triangulating a simple polygon
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Implicitly representing arrangements of lines or segments
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Partitioning arrangements of lines, part II: applications
Discrete & Computational Geometry
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Computational complexity of combinatorial surfaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Constructing strongly convex hulls using exact or rounded arithmetic
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
Small-bias probability spaces: efficient constructions and applications
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
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation
A fast planar partition algorithm, II
Journal of the ACM (JACM)
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On levels in arrangements and Voronoi diagrams
Discrete & Computational Geometry
Randomized multidimensional search trees (extended abstract): dynamic sampling
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
Numerical stability of algorithms for line arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulation and CSG representation of polyhedra with arbitrary genus
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Ray shooting in polygons using Geodesic triangulations
Proceedings of the 18th international colloquium on Automata, languages and programming
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Constructive Whitney-Graustein theorem: or how to untangle closed planar curves
SIAM Journal on Computing
Handbook of theoretical computer science (vol. A)
Algorithmic motion planning in robotics
Handbook of theoretical computer science (vol. A)
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
Cutting hyperplane arrangements
Discrete & Computational Geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Randomized multidimensional search trees: lazy balancing and dynamic shuffling (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Randomized multidimensional search trees: further results in dynamic sampling (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A general approach to removing degeneracies
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the complexity of computing the homology type of a triangulation
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Ray shooting and other applications of spanning trees with low stabbing number
SIAM Journal on Computing
Efficient point location in a convex spatial cell-complex
SIAM Journal on Computing
Convex decomposition of polyhedra and robustness
SIAM Journal on Computing
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Using separation algorithms in fixed dimension
Journal of Algorithms
New results on dynamic planar point location
SIAM Journal on Computing
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A class of convex programs with applications to computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Numerical stability of algorithms for 2D Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Triangulating polygons without large angles
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A rational rotation method for robust geometric algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Determining contractibility of curves
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An upper bound on the number of planar K-sets
Discrete & Computational Geometry
Counting facets and incidences
Discrete & Computational Geometry
Polygon triangulation in O(n log log n) time with simple data structures
Discrete & Computational Geometry
On the randomized construction of the Delaunay tree
Theoretical Computer Science
On the zone theorem for hyperplane arrangements
SIAM Journal on Computing
Radiosity and realistic image synthesis
Radiosity and realistic image synthesis
Journal of Algorithms
Applications of a new space-partitioning technique
Discrete & Computational Geometry
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Computational Geometry: Theory and Applications
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Algorithmic algebra
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
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The union of balls and its dual shape
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An incremental algorithm for Betti numbers of simplicial complexes
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Compatible tetrahedralizations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
On the zone of a surface in a hyperplane arrangement
Discrete & Computational Geometry
Ray shooting and parametric search
SIAM Journal on Computing
Computing a face in an arrangement of line segments and related problems
SIAM Journal on Computing
A deterministic algorithm for the three-dimensional diameter problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds on weak &egr;-nets for convex sets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Output-sensitive methods for rectilinear hidden surface removal
Information and Computation
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
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Triangulating topological spaces
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry in C
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Derandomizing an output-sensitive convex hull algorithm in three dimensions
Computational Geometry: Theory and Applications
Computing a set of points meeting every cell defined by a family of polynomials on a variety
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
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
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An efficiently computable metric for comparing polygonal shapes
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Some Results in Computational Topology
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
A Lower Bound to Finding Convex Hulls
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Robust Set Operations on Polyhedral Solids
IEEE Computer Graphics and Applications
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Four Results on Randomized Incremental Constructions
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Intersecting two polyhedra one of which is convex
FCT '85 Fundamentals of Computation Theory
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An Efficient Multi-Dimensional Searching Technique and itsApplications
An Efficient Multi-Dimensional Searching Technique and itsApplications
Three-Dimensional Recognition of Solid Objects from a Two- Dimensional Image
Three-Dimensional Recognition of Solid Objects from a Two- Dimensional Image
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Verifiable implementations of geometric algorithms using finite precision arithmetic
Verifiable implementations of geometric algorithms using finite precision arithmetic
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces
Information Processing Letters
A Probabilistic Spell for the Curse of Dimensionality
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing
Estimating the indexability of multimedia descriptors for similarity searching
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
| Hi-index | 0.00 |