On the public citation graph
Decomposing the boundary of a nonconvex polyhedron
0 signed · 38 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-12689-9_105openalex-snapshot
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187729openalex-snapshot
On separating two simple polygons by a single translation
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02187807openalex-snapshot
Triangulating a nonconvex polytope
inferredcites →https://doi.org/10.1007/bfb0012784openalex-snapshot
The power of non-rectilinear holes
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0213031openalex-snapshot
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
inferredcites →https://doi.org/10.1137/0221025openalex-snapshot
Convex Decomposition of Polyhedra and Robustness
inferredcites →https://doi.org/10.1145/1499949.1500071openalex-snapshot
A polyhedron representation for computer vision
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/73833.73870openalex-snapshot
On monotone paths among obstacles with applications to planning assemblies
inferredcites →https://doi.org/10.1145/73833.73875openalex-snapshot
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
inferredcites →https://doi.org/10.1145/73833.73876openalex-snapshot
Triangulating a non-convex polytype
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.1050openalex-snapshot
A freeform shape optimization of complex structures represented by arbitrary polygonal or polyhedral meshes
inferred← citeshttps://doi.org/10.1002/nme.859openalex-snapshot
A new scheme for efficient and direct shape optimization of complex structures represented by polygonal meshes
inferred← citeshttps://doi.org/10.1002/vis.315openalex-snapshot
IBCD: a fast collision detection algorithm based on image space using OBB
inferred← citeshttps://doi.org/10.1006/cviu.1996.0041openalex-snapshot
Image Analysis and Computer Vision: 1995
inferred← citeshttps://doi.org/10.1006/cviu.1998.0697openalex-snapshot
Image Analysis and Computer Vision: 1997
inferred← citeshttps://doi.org/10.1007/978-3-642-16785-0_19openalex-snapshot
Assembly Planning and Task Planning — Two Prerequisites for Automated Robot Programming
inferred← citeshttps://doi.org/10.1016/j.cad.2011.06.013openalex-snapshot
Horizontal decomposition of triangulated solids for the simulation of dip-coating processes
inferred← citeshttps://doi.org/10.1016/j.ijsolstr.2010.03.010openalex-snapshot
Real-time self-collision detection algorithms for tensegrity systems
inferred← citeshttps://doi.org/10.1016/s0278-6125(00)87639-6openalex-snapshot
Exact collision detection using virtual objects in virtual reality modeling of a manufacturing process
inferred← citeshttps://doi.org/10.1080/07408170108936805openalex-snapshot
Exact collision detection for a virtual manufacturing simulator
inferred← citeshttps://doi.org/10.1108/13552541111113862openalex-snapshot
An efficient curvature‐based partitioning of large‐scale STL models
inferred← citeshttps://doi.org/10.1109/haptic.2004.1287207openalex-snapshot
Realistic cross-platform haptic applications using freely-available libraries
inferred← citeshttps://doi.org/10.1109/iros.2007.4399240openalex-snapshot
Efficient motion planning for humanoid robots using lazy collision checking and enlarged robot models
inferred← citeshttps://doi.org/10.1109/isatp.2003.1217194openalex-snapshot
Efficient assembly sequence planning using stereographical projections of C-space obstacles
inferred← citeshttps://doi.org/10.1111/1467-8659.00543openalex-snapshot
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
inferred← citeshttps://doi.org/10.1115/detc2003/cie-48291openalex-snapshot
A Framework for Efficient and More Realistic Haptics Applications
inferred← citeshttps://doi.org/10.1145/1477862.1477889openalex-snapshot
Haptic rendering of complex objects via directional sampling
inferred← citeshttps://doi.org/10.1145/3618260.3649756openalex-snapshot
Minimum Star Partitions of Simple Polygons in Polynomial Time
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.01026openalex-snapshot
NP-Hardness of Some Polyhedral Mesh Decomposition Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1903.08778openalex-snapshot
Provable Certificates for Adversarial Examples: Fitting a Ball in the Union of Polytopes
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.