Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Recognising polytopical cell complexes and constructing projection polyhedra
Journal of Symbolic Computation
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
Moving a ladder in three dimensions: upper and lower bounds
SCG '87 Proceedings of the third annual symposium on Computational geometry
Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental
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
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Searching for empty convex polygons
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Algorithms for vertical and orthogonal L1 linear approximation of points
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
Triangles in space or building (and analyzing) castles in the Air
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
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Sweeping arrangements of curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth 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
Parallel algorithms for arrangements
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Cutting hyperplane arrangements
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Stabbing and ray shooting in 3 dimensional space
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
A fast planar partition algorithm, I
Journal of Symbolic Computation
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
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
An efficient algorithm for CSG to b-rep conversion
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
New algorithms for minimum area k-gons
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cutting dense point sets in half
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient learning of continuous neural networks
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
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
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Generalizing ham sandwich cuts to equitable subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Visibility with a moving point of view
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Finding the optimal shadows of a convex polytope
SCG '85 Proceedings of the first annual symposium on Computational geometry
Hamiltonicity and colorings of arrangement graphs
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
A sum of squares theorem for visibility
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On Computing Connected Components of Line Segments
IEEE Transactions on Computers
Computing the Generalized Aspect Graph for Objects with Moving Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Dynamic Planar Convex Hull with Optimal Query Time
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
Hamiltonicity and colorings of arrangement graphs
Discrete Applied Mathematics
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The partition bargaining problem
Discrete Applied Mathematics
Detecting cuts in sensor networks
ACM Transactions on Sensor Networks (TOSN)
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Combinatorics, Probability and Computing
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Topological sweep of the complete graph
Discrete Applied Mathematics
Shape Matching by Random Sampling
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
New Complexity Bounds for Image Matching under Rotation and Scaling
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Theoretical Computer Science
Maximum stabbing line in 2D plane
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
IEEE Transactions on Information Theory
Affine image matching is uniform TC0-complete
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
New complexity bounds for image matching under rotation and scaling
Journal of Discrete Algorithms
Computational Geometry: Theory and Applications
Efficient view point selection for silhouettes of convex polyhedra
Computational Geometry: Theory and Applications
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
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 free-label maximization
Computational Geometry: Theory and Applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms for free-label maximization
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Shape matching by random sampling
Theoretical Computer Science
Operations Research Letters
Heuristics and bounds for the travelling salesman location problem on the plane
Operations Research Letters
Efficient two-dimensional pattern matching with scaling and rotation and higher-order interpolation
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
How to cover a point set with a V-shape of minimum width
Computational Geometry: Theory and Applications
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.07 |