On the public citation graph
Efficient Perturbations for Handling Geometric Degeneracies
0 signed · 61 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/3-540-57785-8_127openalex-snapshot
The nature and meaning of perturbations in geometric computing
inferredcites →https://doi.org/10.1007/978-3-7091-7551-4_7openalex-snapshot
Real Zeros of Polynomials
inferredcites →https://doi.org/10.1007/bfb0042803openalex-snapshot
Symbolic treatment of geometric degeneracies
inferredcites →https://doi.org/10.1016/0020-0190(89)90156-7openalex-snapshot
On the average number of maxima in a set of vectors
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/0097-8485(91)80022-eopenalex-snapshot
Molecular interstitial skeleton
inferredcites →https://doi.org/10.1016/0304-3975(85)90049-0openalex-snapshot
Fast algorithms for the characteristics polynomial
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1016/s0747-7171(08)80018-1openalex-snapshot
Interpolating polynomials from their values
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-1995-1297471-4openalex-snapshot
A Polyhedral Method for Solving Sparse Polynomial Systems
inferredcites →https://doi.org/10.1093/comjnl/37.1.35openalex-snapshot
Degeneracy in Geometric Computation and the Perturbation Approach
inferredcites →https://doi.org/10.1109/sfcs.1992.267751openalex-snapshot
Safe and effective determinant evaluation
inferredcites →https://doi.org/10.1137/s0097539792235918openalex-snapshot
A General Approach to Removing Degeneracies
inferredcites →https://doi.org/10.1142/s0218195998000126openalex-snapshot
A Complete Implementation for Computing General Dimensional Convex Hulls
inferredcites →https://doi.org/10.1145/122718.122725openalex-snapshot
Visibility preprocessing for interactive walkthroughs
inferredcites →https://doi.org/10.1145/142675.142694openalex-snapshot
An efficient approach to removing geometric degeneracies
inferredcites →https://doi.org/10.1145/143242.143300openalex-snapshot
Multipolynomial resultants and linear algebra
inferredcites →https://doi.org/10.1145/164081.164122openalex-snapshot
A practical method for the sparse resultant
inferredcites →https://doi.org/10.1145/192161.192279openalex-snapshot
Partitioning and ordering large radiosity computations
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.1146/annurev.cs.03.060188.001533openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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.1007/3-540-48318-7_15openalex-snapshot
An Easy to Use Implementation of Linear Perturbations within Cupgal
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_5openalex-snapshot
Sparse Resultant Perturbations
inferred← citeshttps://doi.org/10.1007/pl00009330openalex-snapshot
The Nature and Meaning of Perturbations in Geometric Computing
inferred← citeshttps://doi.org/10.1007/s004539910017openalex-snapshot
Probabilistic Algorithms for Efficient Grasping and Fixturing
inferred← citeshttps://doi.org/10.1007/s00454-001-0029-8openalex-snapshot
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
inferred← citeshttps://doi.org/10.1007/s00454-006-1267-6openalex-snapshot
On the Least Median Square Problem
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/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.2011.06.015openalex-snapshot
Controlled linear perturbation
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.comgeo.2011.06.001openalex-snapshot
A general approach to the analysis of controlled perturbation algorithms
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.tcs.2012.09.026openalex-snapshot
Analytical aspects of tie breaking
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)00097-7openalex-snapshot
Algebraic and numerical techniques for the computation of matrix determinants
inferred← citeshttps://doi.org/10.1023/a:1009942427413openalex-snapshot
Removing Degeneracies by Perturbing the Problem or Perturbing the World
inferred← citeshttps://doi.org/10.1090/dimacs/049/08openalex-snapshot
On the distribution of sums of vectors in general position
inferred← citeshttps://doi.org/10.1109/topoinvis68599.2025.00011openalex-snapshot
Robust Geometric Predicates for Bivariate Computational Topology
inferred← citeshttps://doi.org/10.1112/jlms.12716openalex-snapshot
Convergent Hahn series and tropical geometry of higher rank
inferred← citeshttps://doi.org/10.1137/140953800openalex-snapshot
Combinatorial Simplex Algorithms Can Solve Mean Payoff Games
inferred← citeshttps://doi.org/10.1142/s0218195901000523openalex-snapshot
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218195909003143openalex-snapshot
ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
inferred← citeshttps://doi.org/10.1142/s021819591850005xopenalex-snapshot
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
inferred← citeshttps://doi.org/10.1145/1839778.1839782openalex-snapshot
Robust Minkowski sums of polyhedra via controlled linear perturbation
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/997817.997859openalex-snapshot
On the least median square problem
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.1214/ejp.v8-137openalex-snapshot
Berry-Esseen Bounds for the Number of Maxima in Planar Regions
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.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.4236/ajcm.2013.31a003openalex-snapshot
On Constructing Approximate Convex Hull
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6464openalex-snapshot
General Analysis Tool Box for Controlled Perturbation
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.