On the public citation graph
Vertex-Rounding a Three-Dimensional Polyhedral Subdivision
0 signed · 40 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0014476openalex-snapshot
Robustness issues in geometric algorithms
inferredcites →https://doi.org/10.1007/pl00009321openalex-snapshot
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
inferredcites →https://doi.org/10.1007/s004530010004openalex-snapshot
Shortest Path Geometric Rounding
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/b978-0-08-050755-2.50045-2openalex-snapshot
FASTER LINE SEGMENT INTERSECTION
inferredcites →https://doi.org/10.1016/s0010-4485(96)00041-3openalex-snapshot
Polyhedral modelling with multiprecision integer arithmetic
inferredcites →https://doi.org/10.1016/s0925-7721(99)00021-8openalex-snapshot
Practical segment intersection with finite precision output
inferredcites →https://doi.org/10.1109/2.16223openalex-snapshot
The problems of accuracy and robustness in geometric computation
inferredcites →https://doi.org/10.1109/sfcs.1986.19openalex-snapshot
Finite-resolution computational geometry
inferredcites →https://doi.org/10.1109/sfcs.1992.267751openalex-snapshot
Safe and effective determinant evaluation
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/262839.262944openalex-snapshot
Efficient exact evaluation of signs of determinants
inferredcites →https://doi.org/10.1145/262839.262948openalex-snapshot
Computing exact geometric predicates using modular arithmetic with single precision
inferredcites →https://doi.org/10.1145/262839.262985openalex-snapshot
Snap rounding line segments efficiently in two and three dimensions
inferredcites →https://doi.org/10.1145/98524.98579openalex-snapshot
Finding compact coordinate representations for polygons and polyhedra
inferredcites →https://doi.org/10.1145/99902.99905openalex-snapshot
Efficient Delaunay triangulation using rational arithmetic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_23openalex-snapshot
Of What Use Is Floating-Point Arithmetic in Computational Geometry?
inferred← citeshttps://doi.org/10.1016/j.cad.2011.06.015openalex-snapshot
Controlled linear perturbation
inferred← citeshttps://doi.org/10.1016/j.cad.2013.08.035openalex-snapshot
Robust cascading of operations on polyhedra
inferred← citeshttps://doi.org/10.1016/j.cad.2018.10.003openalex-snapshot
Geometric rounding and feature separation in meshes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.08.005openalex-snapshot
Inner and outer rounding of Boolean operations on lattice polygonal regions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.11.009openalex-snapshot
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.09.002openalex-snapshot
Iterated snap rounding with bounded drift
inferred← citeshttps://doi.org/10.1021/cn400186jopenalex-snapshot
Classics in Chemical Neuroscience: Fluoxetine (Prozac)
inferred← citeshttps://doi.org/10.1111/cgf.13592openalex-snapshot
Solid Geometry Processing on Deconstructed Domains
inferred← citeshttps://doi.org/10.1111/cgf.70197openalex-snapshot
Resolving self‐intersections in 3D meshes while preserving floating‐point coordinates
inferred← citeshttps://doi.org/10.1142/s0218195910003402openalex-snapshot
TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS
inferred← citeshttps://doi.org/10.1145/1060244.1060263openalex-snapshot
Boolean operations on 3D selective Nef complexes
inferred← citeshttps://doi.org/10.1145/1137856.1137910openalex-snapshot
Iterated snap rounding with bounded drift
inferred← citeshttps://doi.org/10.1145/1236246.1236273openalex-snapshot
Shape smoothing using double offsets
inferred← citeshttps://doi.org/10.1145/1839778.1839782openalex-snapshot
Robust Minkowski sums of polyhedra via controlled linear perturbation
inferred← citeshttps://doi.org/10.1145/2897824.2925901openalex-snapshot
Mesh arrangements for solid geometry
inferred← citeshttps://doi.org/10.1145/3478513.3480564openalex-snapshot
Convex polyhedral meshing for robust solid modeling
inferred← citeshttps://doi.org/10.1145/3550454.3555460openalex-snapshot
Interactive and Robust Mesh Booleans
inferred← citeshttps://doi.org/10.1145/3687925openalex-snapshot
Exact and Efficient Intersection Resolution for Mesh Arrangements
inferred← citeshttps://doi.org/10.1145/997817.997881openalex-snapshot
Inner and outer rounding of set operations on lattice polygonal regions
inferred← citeshttps://doi.org/10.22028/d291-25697openalex-snapshot
Combinatorial curve reconstruction and the efficient exact implementation of geometric 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.