On the public citation graph
The Nature and Meaning of Perturbations in Geometric Computing
0 signed · 81 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/978-3-0348-7644-5openalex-snapshot
A Primer of Real Analytic Functions
inferredcites →https://doi.org/10.1007/bfb0042803openalex-snapshot
Symbolic treatment of geometric degeneracies
inferredcites →https://doi.org/10.1007/pl00014417openalex-snapshot
Efficient Perturbations for Handling Geometric Degeneracies
inferredcites →https://doi.org/10.1016/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1016/s0747-7171(08)80069-7openalex-snapshot
Symbolic treatment of geometric degeneracies
inferredcites →https://doi.org/10.1016/s0925-7721(96)00023-5openalex-snapshot
How good are convex hull algorithms?
inferredcites →https://doi.org/10.1109/arith.1995.465353openalex-snapshot
An ε arithmetic for removing degeneracies
inferredcites →https://doi.org/10.1109/sfcs.1991.185399openalex-snapshot
A general approach to removing degeneracies
inferredcites →https://doi.org/10.1137/s0097539792235918openalex-snapshot
A General Approach to Removing Degeneracies
inferredcites →https://doi.org/10.1145/142675.142694openalex-snapshot
An efficient approach to removing geometric degeneracies
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/73393.73418openalex-snapshot
Computing Euclidean maximum spanning trees
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1145/800061.808751openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2153424openalex-snapshot
Automatic Differentiation of Algorithms: Theory, Implementation, and Application.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/cviu.1999.0746openalex-snapshot
Image Analysis and Computer Vision: 1998
inferred← citeshttps://doi.org/10.1006/jvci.2001.0503openalex-snapshot
On Computing General Position Views of Data in Three Dimensions
inferred← citeshttps://doi.org/10.1007/11424758_76openalex-snapshot
Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization
inferred← citeshttps://doi.org/10.1007/11537908_28openalex-snapshot
A Marching Method for Computing Intersection Curves of Two Subdivision Solids
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_15openalex-snapshot
An Easy to Use Implementation of Linear Perturbations within Cupgal
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_63openalex-snapshot
On removing non-degeneracy assumptions in computational geometry
inferred← citeshttps://doi.org/10.1007/978-1-4615-0813-7_6openalex-snapshot
Computational Geometry and Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-030-86976-2_3openalex-snapshot
Solving the Coarseness Problem by ILP Using Column Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-02297-0_27openalex-snapshot
A Note on Sekigawa’s Zero Separation Bound
inferred← citeshttps://doi.org/10.1007/978-3-319-21404-7_20openalex-snapshot
Largest Empty Square Queries in Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_52openalex-snapshot
Counting Hexagonal Patches and Independent Sets in Circle Graphs
inferred← citeshttps://doi.org/10.1007/s003710100158openalex-snapshot
A projectively invariant intersection test for polyhedra
inferred← citeshttps://doi.org/10.1007/s00453-011-9561-yopenalex-snapshot
Counting Hexagonal Patches and Independent Sets in Circle Graphs
inferred← citeshttps://doi.org/10.1007/s00453-014-9950-0openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-016-0118-yopenalex-snapshot
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/s10878-018-0347-xopenalex-snapshot
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.cad.2006.10.002openalex-snapshot
Sliver-free perturbation for the Delaunay tetrahedrization
inferred← citeshttps://doi.org/10.1016/j.cad.2019.05.034openalex-snapshot
Watertight Boolean operations: A framework for creating CAD-compatible gap-free editable solid models
inferred← citeshttps://doi.org/10.1016/j.cad.2022.103374openalex-snapshot
Robust Construction of Voronoi Diagrams of Spherical Balls in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1016/j.cagd.2003.11.004openalex-snapshot
Linear perturbation methods for topologically consistent representations of free-form surface intersections
inferred← citeshttps://doi.org/10.1016/j.cagd.2004.01.002openalex-snapshot
Corrigendum to: ‘Linear perturbation methods for topologically consistent representations of free-form surface intersections’
inferred← citeshttps://doi.org/10.1016/j.camwa.2015.06.016openalex-snapshot
Exact, robust, and efficient regularized Booleans on general 3D meshes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.006openalex-snapshot
The predicates of the Apollonius diagram: Algorithmic analysis and implementation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.08.004openalex-snapshot
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.008openalex-snapshot
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.010openalex-snapshot
Perturbations for Delaunay and weighted Delaunay 3D triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.06.001openalex-snapshot
A general approach to the analysis of controlled perturbation algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101794openalex-snapshot
Solving the minimum convex partition of point sets with integer programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.04.003openalex-snapshot
Finding all pure strategy Nash equilibria in a planar location game
inferred← citeshttps://doi.org/10.1016/j.jmatprotec.2007.12.039openalex-snapshot
Generation of cutter paths for hard material in wire EDM
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.026openalex-snapshot
Analytical aspects of tie breaking
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00023-5openalex-snapshot
How good are convex hull algorithms?
inferred← citeshttps://doi.org/10.1023/b:joco.0000038910.06360.0aopenalex-snapshot
Minimal Tetrahedralizations of a Class of Polyhedra
inferred← citeshttps://doi.org/10.1049/ic:20040420openalex-snapshot
From models to efficient code: it's all in the middle
inferred← citeshttps://doi.org/10.1090/crmp/048/03openalex-snapshot
Polyhedral representation conversion up to symmetries
inferred← citeshttps://doi.org/10.1109/hicss.2007.139openalex-snapshot
Composable Language Extensions for Computational Geometry: A Case Study
inferred← citeshttps://doi.org/10.1109/sc.2014.86openalex-snapshot
High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation
inferred← citeshttps://doi.org/10.1109/topoinvis68599.2025.00011openalex-snapshot
Robust Geometric Predicates for Bivariate Computational Topology
inferred← citeshttps://doi.org/10.1111/itor.13428openalex-snapshot
Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
inferred← citeshttps://doi.org/10.1115/1.4047427openalex-snapshot
Reconstruction of Trimmed NURBS Surfaces for Gap-Free Intersections
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch7openalex-snapshot
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
inferred← citeshttps://doi.org/10.1142/s0218195902000815openalex-snapshot
ON DELETION IN DELAUNAY TRIANGULATIONS
inferred← citeshttps://doi.org/10.1142/s0218195906002051openalex-snapshot
THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
inferred← citeshttps://doi.org/10.1145/1185657.1185673openalex-snapshot
Modeling with multiresolution subdivision surfaces
inferred← citeshttps://doi.org/10.1145/1377676.1377694openalex-snapshot
Walking your dog in the woods in polynomial time
inferred← citeshttps://doi.org/10.1145/304893.304969openalex-snapshot
On deletion in Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/383259.383280openalex-snapshot
Approximate Boolean operations on free-form solids
inferred← citeshttps://doi.org/10.1177/027836402320556412openalex-snapshot
Robust Geometric Computing in Motion
inferred← citeshttps://doi.org/10.1201/9781420035315.ch41openalex-snapshot
Robust geometric computation
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.20382/jocg.v8i1a11openalex-snapshot
Qualitative symbolic perturbation: two applications of a new geometry-based perturbation framework
inferred← citeshttps://doi.org/10.22028/d291-26536openalex-snapshot
General analysis tool box for controlled perturbation algorithms and complexity and computation of Θ-guarded regions
inferred← citeshttps://doi.org/10.3934/fods.2025022openalex-snapshot
Discrete level set persistence for finite discrete functions
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1254700openalex-snapshot
Geometric decomposition problems
inferred← citeshttps://doi.org/10.48550/arxiv.0808.3881openalex-snapshot
Counting Hexagonal Patches and Independent Sets in Circle Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6464openalex-snapshot
General Analysis Tool Box for Controlled Perturbation
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3806openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
inferred← citeshttps://doi.org/10.48550/arxiv.1803.11436openalex-snapshot
Delaunay Triangulations of Points on Circles
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9907023openalex-snapshot
On Deletion in Delaunay Triangulation
inferred← citeshttps://doi.org/10.5281/zenodo.3893142openalex-snapshot
Modelling Three-dimensional fields in geoscience with the Voronoi diagram and its dual
inferred← citeshttps://doi.org/10.5555/644108.644160openalex-snapshot
Perturbations and vertex removal in a 3D delaunay triangulation
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.