Rounding arrangements dynamically

Authors:
Leonidas J. Guibas;David H. Marimont
Affiliations:
Xerox Palo Alto Research Center, 3333 Coyote Hill Rd., Palo Alto, Calif. and Department of Computer Science, Stanford University, Stanford, Calif.;Department of Computer Science, Stanford University, Stanford, Calif.
Venue:
Proceedings of the eleventh annual symposium on Computational geometry
Year:
1995

Citing 7
Cited 15

Towards implementing robust geometric computations

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
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 planar partition algorithm, I

Journal of Symbolic Computation
Numerical stability of algorithms for line arrangements

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane

Journal of the ACM (JACM)
Verifiable implementations of geometric algorithms using finite precision arithmetic

Verifiable implementations of geometric algorithms using finite precision arithmetic

On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

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
Rotational polygon containment and minimum enclosure

Proceedings of the fourteenth annual symposium on Computational geometry
Design and analysis of planar shape deformation

Proceedings of the fourteenth annual symposium on Computational geometry
Vertex-rounding a three-dimensional polyhedral subdivision

Proceedings of the fourteenth annual symposium on Computational geometry
Rounding voronoi diagram

Theoretical Computer Science
Finite-Resolution Simplicial Complexes

Geoinformatica
Dual Grid: A New Approach for Robust Spatial Algebra Implementation

Geoinformatica
Rounding Voronoi Diagram

DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Meshless animation of fracturing solids

ACM SIGGRAPH 2005 Papers
Improved output-sensitive snap rounding

Proceedings of the twenty-second annual symposium on Computational geometry
A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

Operations Research
Stable snap rounding

Proceedings of the twenty-seventh annual symposium on Computational geometry
Design and analysis of planar shape deformation

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Rounding arrangements dynamically

Quantified Score

Visualization

Abstract