Robust geometric computation based on topological consistency

DOI10.1007/3-540-45545-0_10MaRDI QIDQ2779282zbMATH OpenFDO

Authors K. Sugihara

Publication date 15 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2073/20730012

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• Topology-oriented approach to robust geometric computation
• Topology-oriented implementation -- an approach to robust geometric algorithms
• Computing and Combinatorics
• Topologically consistent algorithms related to convex polyhedra
• A paradigm for robust geometric algorithms

Cited in

(14)

• Topology-oriented implementation -- an approach to robust geometric algorithms
• A robust algorithm for bisecting a triconnected graph with two resource sets
• Topology-oriented approach to robust geometric computation
• A Characterization of Consistent Digital Line Segments in ℤ2
• Robust Topological Operations for Dynamic Explicit Surfaces
• Reliable and Efficient Computational Geometry Via Controlled Perturbation
• Robustness in geometric modeling -- tolerance-based methods
• Consistent digital line segments
• Topologically consistent algorithms related to convex polyhedra
• High Dimensional Consistent Digital Segments
• Computing and Combinatorics
• Robustness and Randomness
• Consistent digital rays
• Robustness of numerical methods in geometric computation when problem data is uncertain

Describes a project that uses

Uses Software

• Hull

This page was built for publication: Robust geometric computation based on topological consistency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2779282)