Coordinate representation of order types requires exponential storage
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The design of LINETOOL, a geometric editor
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Calculating approximate curve arrangements using rounded arithmetic
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Using tolerances to guarantee valid polyhedral modeling results
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
Numerical stability of algorithms for line arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Numerical stability of algorithms for 2D Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Resolvable representation of polyhedra
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Obtaining robust Boolean set operations for manifold solids by avoiding and eliminating redundancy.
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polyhedral modelling with exact arithmetic
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Parallel robust algorithms for constructing strongly convex hulls
Proceedings of the twelfth annual symposium on Computational geometry
A perturbation scheme for spherical arrangements with application to molecular modeling
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Vertex-rounding a three-dimensional polyhedral subdivision
Proceedings of the fourteenth annual symposium on Computational geometry
Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An Intersection Algorithm Based on Delaunay Triangulation
IEEE Computer Graphics and Applications
Robust algorithms for constructing strongly convex hulls in parallel
Theoretical Computer Science
Robust Geometric Computation Based on Topological Consistency
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Topology-Oriented Approach to Robust Geometric Computation
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Controlled perturbation for arrangements of circles
Proceedings of the nineteenth annual symposium on Computational geometry
Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
A robust algorithm for bisecting a triconnected graph with two resource sets
Theoretical Computer Science
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Connectivity in the regular polytope representation
Geoinformatica
| Hi-index | 0.00 |