On the public citation graph
Symbolic treatment of geometric degeneracies
0 signed · 83 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-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01400115openalex-snapshot
On condition numbers and the distance to the nearest ill-posed problem
inferredcites →https://doi.org/10.1007/bf01840438openalex-snapshot
Edge-skeletons in arrangements with applications
inferredcites →https://doi.org/10.1007/bf03167059openalex-snapshot
Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—
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/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1016/0196-6774(85)90021-5openalex-snapshot
A “retraction” method for planning the motion of a disc
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/s0747-7171(86)80020-7openalex-snapshot
Computing a ham-sandwich cut in two dimensions
inferredcites →https://doi.org/10.1090/s0025-5718-1988-0929546-7openalex-snapshot
The Probability That a Numerical Analysis Problem is Difficult
inferredcites →https://doi.org/10.1109/sfcs.1986.19openalex-snapshot
Finite-resolution computational geometry
inferredcites →https://doi.org/10.1115/1.3424591openalex-snapshot
Catastrophe Theory and Its Applications
inferredcites →https://doi.org/10.1137/0204045openalex-snapshot
Evaluating Polynomials at Fixed Sets of Points
inferredcites →https://doi.org/10.1137/0209022openalex-snapshot
On the Evaluation of Powers and Monomials
inferredcites →https://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
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.2307/1907845openalex-snapshot
Optimality and Degeneracy in Linear Programming
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0134(19981001)33:1<1::aid-prot1>3.0.co;2-oopenalex-snapshot
Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape
inferred← citeshttps://doi.org/10.1006/jcom.1996.0021openalex-snapshot
Topological Complexity with Continuous Operations
inferred← citeshttps://doi.org/10.1006/jsco.1993.1039openalex-snapshot
An Axiomatic Approach to Robust Geometric Programs
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/3-540-48318-7_15openalex-snapshot
An Easy to Use Implementation of Linear Perturbations within Cupgal
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_127openalex-snapshot
The nature and meaning of perturbations in geometric computing
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/3-540-63818-0_9openalex-snapshot
Precision and robustness in geometric computations
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_30openalex-snapshot
Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-13992-6_20openalex-snapshot
Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
inferred← citeshttps://doi.org/10.1007/978-3-540-33259-6openalex-snapshot
Effective Computational Geometry for Curves and Surfaces
inferred← citeshttps://doi.org/10.1007/bf01427151openalex-snapshot
Constrained pose refinement of parametric objects
inferred← citeshttps://doi.org/10.1007/bf02733466openalex-snapshot
Stability of solutions in problems of computing geometry
inferred← citeshttps://doi.org/10.1007/bf02948789openalex-snapshot
Fast theorem-proving and Wu’s Method
inferred← citeshttps://doi.org/10.1007/pl00009330openalex-snapshot
The Nature and Meaning of Perturbations in Geometric Computing
inferred← citeshttps://doi.org/10.1007/pl00014417openalex-snapshot
Efficient Perturbations for Handling Geometric Degeneracies
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00040-2openalex-snapshot
Towards exact geometric computation
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/j.cad.2006.10.002openalex-snapshot
Sliver-free perturbation for the Delaunay tetrahedrization
inferred← citeshttps://doi.org/10.1016/j.cad.2019.102801openalex-snapshot
An Efficient and Exact Parallel Algorithm for Intersecting Large 3-D Triangular Meshes Using Arithmetic Filters
inferred← citeshttps://doi.org/10.1016/j.cagd.2021.102023openalex-snapshot
A dynamic sampling approach towards computing Voronoi diagram of a set of circles
inferred← citeshttps://doi.org/10.1016/j.csda.2006.09.004openalex-snapshot
Point set stratification and Delaunay depth
inferred← citeshttps://doi.org/10.1016/j.gmod.2004.07.001openalex-snapshot
An optimization algorithm for free-form surface partitioning based on weighted gaussian image
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.2005.09.053openalex-snapshot
Stability versus speed in a computable algebraic model
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.026openalex-snapshot
Analytical aspects of tie breaking
inferred← citeshttps://doi.org/10.1016/s0010-4485(00)00055-5openalex-snapshot
Satisfying coplanarity constraints on points sets in three dimensions with finite precision arithmetic
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00202-9openalex-snapshot
Three-dimensional convex hull as a fruitful source of diagrams
inferred← citeshttps://doi.org/10.1017/s0962492900001331openalex-snapshot
Triangulations and meshes in computational geometry
inferred← citeshttps://doi.org/10.1080/10556789808805719openalex-snapshot
Topology-oriented construction of three-dimensional convex hulls
inferred← citeshttps://doi.org/10.1109/isvd.2006.31openalex-snapshot
Robust Point-Location in Generalized Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/pccga.1999.803350openalex-snapshot
Exact computation of 4-D convex hulls with perturbation and acceleration
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185399openalex-snapshot
A general approach to removing degeneracies
inferred← citeshttps://doi.org/10.1142/s0218195904001512openalex-snapshot
OVERLAYING SURFACE MESHES, PART I: ALGORITHMS
inferred← citeshttps://doi.org/10.1142/s0218195909003143openalex-snapshot
ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
inferred← citeshttps://doi.org/10.1145/142675.142694openalex-snapshot
An efficient approach to removing geometric degeneracies
inferred← citeshttps://doi.org/10.1145/177424.178010openalex-snapshot
Triangulating topological spaces
inferred← citeshttps://doi.org/10.1145/218013.218065openalex-snapshot
Polyhedral modelling with exact arithmetic
inferred← citeshttps://doi.org/10.1145/220279.220282openalex-snapshot
How good are convex hull algorithms?
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.1145/3139958.3140001openalex-snapshot
Fast exact parallel 3D mesh intersection algorithm using only orientation predicates
inferred← citeshttps://doi.org/10.1145/3326229.3326270openalex-snapshot
Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
inferred← citeshttps://doi.org/10.1145/336154.336206openalex-snapshot
Linear-time triangulation of a simple polygon made easier via randomization
inferred← citeshttps://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferred← citeshttps://doi.org/10.1145/73393.73407openalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferred← citeshttps://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferred← citeshttps://doi.org/10.1201/9781420035315.ch41openalex-snapshot
Robust geometric computation
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.2312/sm.20041409openalex-snapshot
Handling Degeneracies in Exact Boundary Evaluation
inferred← citeshttps://doi.org/10.47749/t/unicamp.2007.415555openalex-snapshot
A estrutura de dados gema para representação de mapas n-dimensionais
inferred← citeshttps://doi.org/10.48550/arxiv.0910.1387openalex-snapshot
Simpler Proofs by Symbolic Perturbation
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6464openalex-snapshot
General Analysis Tool Box for Controlled Perturbation
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00073openalex-snapshot
Bijective Deformations in $\mathbb{R}^n$ via Integral Curve Coordinates
inferred← citeshttps://doi.org/10.48550/arxiv.1803.11436openalex-snapshot
Delaunay Triangulations of Points on Circles
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06658openalex-snapshot
Predicates of the 3D Apollonius Diagram
inferred← citeshttps://doi.org/10.5555/2772879.2773332openalex-snapshot
General Tiebreaking Schemes for Computational Social Choice
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.