On the public citation graph

Robustness issues in geometric algorithms

https://doi.org/10.1007/bfb0014476
0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0049411openalex-snapshot
How to compute the Voronoi diagram of line segments: Theoretical and experimental results
inferredcites →https://doi.org/10.1016/0004-3702(88)90061-6openalex-snapshot
Verifiable implementations of geometric algorithms using finite precision arithmetic
inferredcites →https://doi.org/10.1016/0010-4485(93)90072-vopenalex-snapshot
Robustness in solid modelling: a tolerance-based intuitionistic approach
inferredcites →https://doi.org/10.1109/2.16223openalex-snapshot
The problems of accuracy and robustness in geometric computation
inferredcites →https://doi.org/10.1109/5.163412openalex-snapshot
Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic
inferredcites →https://doi.org/10.1109/sfcs.1992.267751openalex-snapshot
Safe and effective determinant evaluation
inferredcites →https://doi.org/10.1142/9789812831699_0011openalex-snapshot
THE EXACT COMPUTATION PARADIGM
inferredcites →https://doi.org/10.1142/s0218195995000118openalex-snapshot
NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
inferredcites →https://doi.org/10.1145/160985.161015openalex-snapshot
Efficient exact arithmetic for computational geometry
inferredcites →https://doi.org/10.1145/218013.218065openalex-snapshot
Polyhedral modelling with exact arithmetic
inferredcites →https://doi.org/10.1145/218013.218067openalex-snapshot
Boundary representation modelling with local tolerances
inferredcites →https://doi.org/10.1145/220279.220300openalex-snapshot
Rounding arrangements dynamically
inferredcites →https://doi.org/10.1145/231731.231735openalex-snapshot
Static analysis yields efficient exact integer arithmetic for computational geometry
inferredcites →https://doi.org/10.1145/237218.237337openalex-snapshot
Robust adaptive floating-point geometric predicates
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1099-1778(200005)11:2<69::aid-vis219>3.0.co;2-7openalex-snapshot
Computing swept volumes
inferred← citeshttps://doi.org/10.1007/978-1-4615-0813-7_8openalex-snapshot
Reliable Geometric Computations with Algebraic Primitives and Predicates
inferred← citeshttps://doi.org/10.1007/bfb0014474openalex-snapshot
Applied Computational Geometry Towards Geometric Engineering
inferred← citeshttps://doi.org/10.1007/bfb0014477openalex-snapshot
Implementing geometric algorithms robustly
inferred← citeshttps://doi.org/10.1007/pl00009480openalex-snapshot
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50015-2openalex-snapshot
Robustness and Precision Issues in Geometric Computation**Work on this survey was partially supported by the ESPRIT IV Long Term Research Project No. 21957 (CGAL).
inferred← citeshttps://doi.org/10.1016/s0010-4485(00)00054-3openalex-snapshot
Efficient and exact manipulation of algebraic points and curves
inferred← citeshttps://doi.org/10.1016/s0010-4655(02)00629-xopenalex-snapshot
A geometry modeling system for ray tracing or particle transport Monte Carlo simulation
inferred← citeshttps://doi.org/10.1016/s0167-8396(99)00032-1openalex-snapshot
Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: I—representations
inferred← citeshttps://doi.org/10.1109/smi.2006.29openalex-snapshot
ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes
inferred← citeshttps://doi.org/10.1134/s0361768824700105openalex-snapshot
Constructing the Internal Voronoi Diagram of Polygonal Figure Using the Sweepline Method
inferred← citeshttps://doi.org/10.1142/s0218195904001512openalex-snapshot
OVERLAYING SURFACE MESHES, PART I: ALGORITHMS
inferred← citeshttps://doi.org/10.1142/s021819590700229xopenalex-snapshot
AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
inferred← citeshttps://doi.org/10.1145/1108590.1108611openalex-snapshot
Volume subdivision based hexahedral finite element meshing of domains with interior 2-manifold boundaries
inferred← citeshttps://doi.org/10.1145/1137856.1137892openalex-snapshot
An approximate arrangement algorithm for semi-algebraic curves
inferred← citeshttps://doi.org/10.1145/262839.262847openalex-snapshot
Accelerated occlusion culling using shadow frusta
inferred← citeshttps://doi.org/10.1145/262839.262955openalex-snapshot
A perturbation scheme for spherical arrangements with application to molecular modeling
inferred← citeshttps://doi.org/10.1145/262839.263009openalex-snapshot
Robust and efficient evaluation of functionals on parametric surfaces
inferred← citeshttps://doi.org/10.1145/267734.267753openalex-snapshot
Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic
inferred← citeshttps://doi.org/10.1145/276884.276897openalex-snapshot
Vertex-rounding a three-dimensional polyhedral subdivision
inferred← citeshttps://doi.org/10.1145/304893.304965openalex-snapshot
Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes
inferred← citeshttps://doi.org/10.1201/9780367803735-7openalex-snapshot
Geometric Proximity Graphs
inferred← citeshttps://doi.org/10.1201/b10626-12openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.12785/amis/080607openalex-snapshot
Numerical Robustness in Geometric Computation: An Expository Summary
inferred← citeshttps://doi.org/10.17615/2w96-2x05openalex-snapshot
Degree-Driven Design of Geometric Algorithms for Point Location, Proximity, and Volume Calculation
inferred← citeshttps://doi.org/10.22215/etd/2016-11611openalex-snapshot
Geophysical Applications of Electrical Impedance Tomography
inferred← citeshttps://doi.org/10.31857/s0132347424040026openalex-snapshot
Constructing the internal Voronoi diagram of a polygonal figure using the sweep method
inferred← citeshttps://doi.org/10.4086/cjtcs.2009.002openalex-snapshot
inferred← citeshttps://doi.org/10.47749/t/unicamp.2005.778801openalex-snapshot
Modelagem geométrica colaborativa e multiplataforma
inferred← citeshttps://doi.org/10.48456/tr-766openalex-snapshot
Towards robust inexact geometric computation
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04065openalex-snapshot
Trustworthy Graph Algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.