On the public citation graph
Evaluating signs of determinants using single-precision arithmetic
0 signed · 71 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-51486-4_58openalex-snapshot
LEDA a library of efficient data types and algorithms
inferredcites →https://doi.org/10.1007/978-3-642-76118-8_3openalex-snapshot
LEDA A Library of Efficient Data Types and Algorithms
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.1109/38.41469openalex-snapshot
Robust set operations on polyhedral solids
inferredcites →https://doi.org/10.1109/sfcs.1986.19openalex-snapshot
Finite-resolution computational geometry
inferredcites →https://doi.org/10.1109/sfcs.1989.63524openalex-snapshot
Stable maintenance of point set triangulations in two dimensions
inferredcites →https://doi.org/10.1109/sfcs.1989.63525openalex-snapshot
Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic
inferredcites →https://doi.org/10.1109/sfcs.1992.267751openalex-snapshot
Safe and effective determinant evaluation
inferredcites →https://doi.org/10.1145/109648.109685openalex-snapshot
Numerical stability of algorithms for line arrangements
inferredcites →https://doi.org/10.1145/142675.142695openalex-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/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
inferredcites →https://doi.org/10.1145/73833.73857openalex-snapshot
Epsilon geometry: building robust algorithms from imprecise computations
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.1002/(sici)1097-0207(19961030)39:20<3407::aid-nme5>3.0.co;2-copenalex-snapshot
OPTIMAL DELAUNAY POINT INSERTION
inferred← citeshttps://doi.org/10.1007/3-540-44577-3_19openalex-snapshot
From Algorithm to Program to Software Library
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_9openalex-snapshot
Precision and robustness in geometric computations
inferred← citeshttps://doi.org/10.1007/978-1-4615-4541-5_28openalex-snapshot
Aquarels: A Problem-Solving Environment for Validating Scientific Software
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_57openalex-snapshot
Ham-Sandwich Cuts for Abstract Order Types
inferred← citeshttps://doi.org/10.1007/978-3-540-30231-5_7openalex-snapshot
Floating-Point Filter for the Line Intersection Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/bfb0014496openalex-snapshot
The CGAL kernel: A basis for geometric computation
inferred← citeshttps://doi.org/10.1007/bfb0014497openalex-snapshot
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
inferred← citeshttps://doi.org/10.1007/bfb0036075openalex-snapshot
Collision detection algorithms for motion planning
inferred← citeshttps://doi.org/10.1007/pl00009321openalex-snapshot
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
inferred← citeshttps://doi.org/10.1007/s00453-001-0028-4openalex-snapshot
FIST: Fast Industrial-Strength Triangulation of Polygons
inferred← citeshttps://doi.org/10.1007/s00453-001-0032-8openalex-snapshot
Certification of Numerical Computation of the Sign of the Determinant of a Matrix
inferred← citeshttps://doi.org/10.1007/s00453-016-0246-4openalex-snapshot
Ham-Sandwich Cuts for Abstract Order Types
inferred← citeshttps://doi.org/10.1007/s004530010003openalex-snapshot
Efficient Exact Evaluation of Signs of Determinants
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.aei.2018.08.004openalex-snapshot
Reconstruction of edges in digital building models
inferred← citeshttps://doi.org/10.1016/j.cag.2008.05.002openalex-snapshot
Collision detection between complex polyhedra
inferred← citeshttps://doi.org/10.1016/j.cam.2003.08.019openalex-snapshot
Computing the sign or the value of the determinant of an integer matrix, a complexity survey
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.03.022openalex-snapshot
Additive preconditioning and aggregation in matrix computations
inferred← citeshttps://doi.org/10.1016/j.ic.2011.09.007openalex-snapshot
A robust algorithm for geometric predicate by error-free determinant transformation
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00074-2openalex-snapshot
Slicing Minkowski sums for satellite antenna layout
inferred← citeshttps://doi.org/10.1016/s0097-8493(00)00130-8openalex-snapshot
3D collision detection: a survey
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00231-6openalex-snapshot
Interval arithmetic yields efficient dynamic filters for computational geometry
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.1016/s0898-1221(98)00041-8openalex-snapshot
A fast and robust RNS algorithm for evaluating signs of determinants
inferred← citeshttps://doi.org/10.1017/s0890060400003218openalex-snapshot
Algorithms for computing intersection and union of toleranced polygons with applications
inferred← citeshttps://doi.org/10.1109/isvd.2012.13openalex-snapshot
Computing the Nearest Neighbor Transform Exactly with Only Double Precision
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892335openalex-snapshot
On computing the determinant and Smith form of an integer matrix
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2006.00917.xopenalex-snapshot
Particle Oriented Collision Detection using Simplicial Coverings and Tetra‐Trees
inferred← citeshttps://doi.org/10.1137/050645671openalex-snapshot
Accurate Floating-Point Summation Part I: Faithful Rounding
inferred← citeshttps://doi.org/10.1137/s0097539796305365openalex-snapshot
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
inferred← citeshttps://doi.org/10.1137/s0097539797329373openalex-snapshot
Robust Plane Sweep for Intersecting Segments
inferred← citeshttps://doi.org/10.1142/s0218195901000390openalex-snapshot
A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
inferred← citeshttps://doi.org/10.1142/s0218195901000626openalex-snapshot
THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218195903001256openalex-snapshot
A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES
inferred← citeshttps://doi.org/10.1145/237218.237337openalex-snapshot
Robust adaptive floating-point geometric predicates
inferred← citeshttps://doi.org/10.1145/2525314.2525352openalex-snapshot
Robust and efficient polygon overlay on parallel stream processors
inferred← citeshttps://doi.org/10.1145/262839.262904openalex-snapshot
Minkowski operations for satellite antenna layout
inferred← citeshttps://doi.org/10.1145/262839.262944openalex-snapshot
Efficient exact evaluation of signs of determinants
inferred← citeshttps://doi.org/10.1145/276884.276903openalex-snapshot
Interval arithmetic yields efficient dynamic filters for computational geometry
inferred← citeshttps://doi.org/10.1145/304893.304991openalex-snapshot
Efficient algorithms for line and curve segment intersection using restricted predicates
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.3929/ethz-b-000123237openalex-snapshot
Ham-Sandwich Cuts for Abstract Order Types
inferred← citeshttps://doi.org/10.4236/ajcm.2014.45039openalex-snapshot
Combining Algebraic and Numerical Techniques for Computing Matrix Determinant
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6464openalex-snapshot
General Analysis Tool Box for Controlled Perturbation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0107025openalex-snapshot
Computer validated proofs of a toolset for adaptable arithmetic
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.