The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Computational geometry: an introduction
Computational geometry: an introduction
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Finding the optimal shadows of a convex polytope
SCG '85 Proceedings of the first annual symposium on Computational geometry
Computing the largest empty convex subset of a set of points
SCG '85 Proceedings of the first annual symposium on Computational geometry
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proximity and reachability in the plane.
Proximity and reachability in the plane.
Computing convolutions by reciprocal search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
The complexity of cutting convex polytypes
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
New methods for computing visibility graphs
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
On the general motion planning problem with two degrees of freedom
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
Sweeping arrangements of curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Efficient parallel computation of arrangements of hyperplanes in d dimensions
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Locating a robot with angle measurements
Journal of Symbolic Computation
Computing shortest transversals of sets (extended abstract)
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
Constructing arrangements optimally in parallel (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
New algorithms for minimum area k-gons
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An efficient approach to removing geometric degeneracies
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)
Topologically sweeping the visibility complex of polygonal scenes
Proceedings of the eleventh annual symposium on Computational geometry
Applying parallel processing techniques to classification problems in constructive solid geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
SilSketch: automated sketch-based editing of surface meshes
SBIM '07 Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling
Sketch-based Interfaces: Sketching contours
Computers and Graphics
Particle-based forecast mechanism for continuous collision detection in deformable environments
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Finding minimum area simple pentagons
Operations Research Letters
Heuristics and bounds for the travelling salesman location problem on the plane
Operations Research Letters
| Hi-index | 0.00 |