Numerical stability of geometric algorithms
SCG '87 Proceedings of the third annual symposium on Computational geometry
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A geometric consistency theorem for a symbolic perturbation scheme
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Coordinate representation of order types requires exponential storage
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
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)
Numerical stability of algorithms for line arrangements
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
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Robust gift wrapping for the three-dimensional convex hull
Journal of Computer and System Sciences
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Rounding arrangements dynamically
Proceedings of the eleventh annual symposium on Computational geometry
Parallel robust algorithms for constructing strongly convex hulls
Proceedings of the twelfth annual symposium on Computational geometry
Snap rounding line segments efficiently in two and three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Classical computational geometry in GeomNet
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
IEEE Transactions on Computers
Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
Crust and anti-crust: a one-step boundary and skeleton extraction algorithm
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient algorithms for line and curve segment intersection using restricted predicates
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A formal model for the discrete representation of spatial objects
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Foundation of a computable solid modelling
Theoretical Computer Science
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
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Topology-Oriented Approach to Robust Geometric Computation
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
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
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A package for exact kinetic data structures and sweepline algorithms
Computational Geometry: Theory and Applications
An efficient and robust particle-localization algorithm for unstructured grids
Journal of Computational Physics
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Homotopy Conditions for Tolerant Geometric Queries
Reliable Implementation of Real Number Algorithms: Theory and Practice
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
The Directed Hausdorff Distance between Imprecise Point Sets
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A robust segment/triangle intersection algorithm for interference tests. Efficiency study
Computational Geometry: Theory and Applications
Point distance and orthogonal range problems with dependent geometric uncertainties
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Controlled Perturbation of sets of line segments in R2 with smart processing order
Computational Geometry: Theory and Applications
The maximal distance between imprecise point objects
Fuzzy Sets and Systems
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
Proceedings of the twenty-seventh annual symposium on Computational geometry
The directed Hausdorff distance between imprecise point sets
Theoretical Computer Science
Geometric computations on indecisive points
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Property-Preserving data reconstruction
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Linear fuzzy space based road lane model and detection
Knowledge-Based Systems
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
Geometric interoperability via queries
Computer-Aided Design
| Hi-index | 0.01 |