A paradigm for robust geometric algorithms
From MaRDI portal
Recommendations
- Topologically consistent algorithms related to convex polyhedra
- LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION
- scientific article; zbMATH DE number 1008329
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Topology-oriented implementation -- an approach to robust geometric algorithms
Cites work
- How to Draw a Graph
- scientific article; zbMATH DE number 3846996 (Why is no real title available?)
- scientific article; zbMATH DE number 3851896 (Why is no real title available?)
- scientific article; zbMATH DE number 3785798 (Why is no real title available?)
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- Rigidity and energy
- The dissection of rectangles into squares
Cited in
(34)- Rigidity and the Alexandrov-Fenchel inequality
- Advances in the theory and practice of graph drawing
- An axiomatic approach to robust geometric programs
- Robust gift wrapping for the three-dimensional convex hull
- Three-dimensional unstructured mesh generation. III: Volume meshes
- Tutte's barycenter method applied to isotopies
- Topology-oriented implementation -- an approach to robust geometric algorithms
- Planar and toroidal morphs made easier
- Topology-oriented approach to robust geometric computation
- Robust geometric computation based on topological consistency
- Another Classroom Example of Robustness Problems in Planar Convex Hull Computation
- How to make elementary geometry more robust and thus, more practical: general algorithms
- Planar shape manipulation using approximate geometric primitives
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- scientific article; zbMATH DE number 4078610 (Why is no real title available?)
- scientific article; zbMATH DE number 4080990 (Why is no real title available?)
- scientific article; zbMATH DE number 4108579 (Why is no real title available?)
- Robustness in geometric modeling -- tolerance-based methods
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION
- scientific article; zbMATH DE number 1952042 (Why is no real title available?)
- Robust geometric computation based on digital topology
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- Homotopy Conditions for Tolerant Geometric Queries
- Classroom examples of robustness problems in geometric computations
- Planar and Toroidal Morphs Made Easier
- Fast Algorithms for Geometric Consensuses
- Small grid embeddings of 3-polytopes
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- On recent trends in discrete geometry in computer science
- Manipulating weights to improve stress-graph drawings of 3-connected planar graphs
- A duality transform for constructing small grid embeddings of 3d polytopes
- Shelling and sinking graphs on the sphere
- Applications of unbiased perturbations towards quantifying robustness with pragmatic geometric methods
This page was built for publication: A paradigm for robust geometric algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185288)
