On the public citation graph
Triangulating point sets in space
0 signed · 41 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.1016/s0747-7171(08)80068-5openalex-snapshot
Tetrahedrizing point sets in three dimensions†
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/10515.10530openalex-snapshot
Triangulating simplicial point sets in space
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.3240060403openalex-snapshot
Geometric algorithms for the minimum cost assignment problem
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_27openalex-snapshot
Algorithms and Complexity for Tetrahedralization Detections
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_29openalex-snapshot
Tetrahedralization of Two Nested Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_31openalex-snapshot
Tetrahedrizing point sets in three dimensions
inferred← citeshttps://doi.org/10.1007/3-540-51683-2_35openalex-snapshot
Triangulation in 2D and 3D space
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_92openalex-snapshot
Splitting a configuration in a simplex
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_7openalex-snapshot
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms
inferred← citeshttps://doi.org/10.1007/bf01190161openalex-snapshot
Splitting a configuration in a simplex
inferred← citeshttps://doi.org/10.1007/bf01782475openalex-snapshot
Hamiltonian triangulations for fast rendering
inferred← citeshttps://doi.org/10.1007/bf02187840openalex-snapshot
On the difficulty of triangulating three-dimensional Nonconvex Polyhedra
inferred← citeshttps://doi.org/10.1007/bfb0049395openalex-snapshot
Hamiltonian triangulations for fast rendering
inferred← citeshttps://doi.org/10.1007/s00454-002-2707-6openalex-snapshot
The Size of Spanning Disks for Polygonal Curves
inferred← citeshttps://doi.org/10.1007/s004540010058openalex-snapshot
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
inferred← citeshttps://doi.org/10.1007/s40590-015-0080-8openalex-snapshot
Hamiltonian tetrahedralizations with Steiner points
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.010openalex-snapshot
Connecting colored point sets
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.006openalex-snapshot
Detecting tetrahedralizations of a set of line segments
inferred← citeshttps://doi.org/10.1016/j.mechmachtheory.2016.06.015openalex-snapshot
A gripper design algorithm for grasping a set of parts in manufacturing lines
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00092-0openalex-snapshot
The complexity of finding small triangulations of convex 3-polytopes
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80068-5openalex-snapshot
Tetrahedrizing point sets in three dimensions†
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00027-8openalex-snapshot
Illumination by floodlights
inferred← citeshttps://doi.org/10.1023/b:joco.0000038910.06360.0aopenalex-snapshot
Minimal Tetrahedralizations of a Class of Polyhedra
inferred← citeshttps://doi.org/10.1090/s0894-0347-01-00358-7openalex-snapshot
The number of Reidemeister moves needed for unknotting
inferred← citeshttps://doi.org/10.1109/sccg.2001.945334openalex-snapshot
Post-optimization of Delaunay tetrahedrization
inferred← citeshttps://doi.org/10.1109/visual.1990.146400openalex-snapshot
Techniques for visualizing 3-dimensional manifolds
inferred← citeshttps://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferred← citeshttps://doi.org/10.1145/109648.109678openalex-snapshot
Geometric algorithms for a minimum cost assignment problem
inferred← citeshttps://doi.org/10.1177/02783649231182486openalex-snapshot
Simple kinesthetic haptics for object recognition
inferred← citeshttps://doi.org/10.4310/jdg/1102536708openalex-snapshot
Area Inequalities for Embedded Disks Spanning Unknotted Curves
inferred← citeshttps://doi.org/10.48550/arxiv.math/0306313openalex-snapshot
Area Inequalities for Embedded Disks Spanning Unknotted Curves
inferred← citeshttps://doi.org/10.5555/882484.883954openalex-snapshot
Post-Optimization of Delaunay Tetrahedrization
inferred← citeshttps://doi.org/10.5937/kgjmath1702203sopenalex-snapshot
2-toroids and their 3-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.