On the public citation graph
Triangulating a nonconvex polytope
0 signed · 116 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-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/3-540-52048-1_49openalex-snapshot
Robust decompositions of polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bf02187904openalex-snapshot
Nonobtuse triangulation of polygons
inferredcites →https://doi.org/10.1007/bfb0012784openalex-snapshot
The power of non-rectilinear holes
inferredcites →https://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
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/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1109/sfcs.1987.1openalex-snapshot
A new algebraic method for robot motion planning and real geometry
inferredcites →https://doi.org/10.1109/t-c.1975.224276openalex-snapshot
Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
inferredcites →https://doi.org/10.1109/tc.1978.1675001openalex-snapshot
Decomposition of Polygons into Convex Sets
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/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0215069openalex-snapshot
On Approximations and Incidence in Cylindrical Algebraic Decompositions
inferredcites →https://doi.org/10.1145/10515.10542openalex-snapshot
Implementing Watson's algorithm in three dimensions
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/41958.41967openalex-snapshot
Primitives for the manipulation of three-dimensional subdivisions
inferredcites →https://doi.org/10.1145/73393.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
inferredcites →https://doi.org/10.1145/73833.73875openalex-snapshot
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
inferredcites →https://doi.org/10.2307/1969908openalex-snapshot
Elementary Structure of Real Algebraic Varieties
inferredcites →https://doi.org/10.2514/6.1987-1124openalex-snapshot
Three dimensional mesh generation by triangulation of arbitrary point sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119176817.ecm2106openalex-snapshot
Isogeometric Analysis: Representation of Geometry
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.3016openalex-snapshot
3D boundary recovery by constrained Delaunay tetrahedralization
inferred← citeshttps://doi.org/10.1002/nme.452openalex-snapshot
Modelling three‐dimensional piece‐wise homogeneous domains using the α‐shape‐based natural element method
inferred← citeshttps://doi.org/10.1002/nme.5752openalex-snapshot
Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
inferred← citeshttps://doi.org/10.1002/nme.808openalex-snapshot
‘Ultimate’ robustness in meshing an arbitrary polyhedron
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.1007/3-540-30790-7_2openalex-snapshot
On the Convexification of Unstructured Grids from a Scientific Visualization Perspective
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-44634-6_36openalex-snapshot
A Decomposition-Based Approach to Layered Manufacturing
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-45678-3_16openalex-snapshot
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_33openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_34openalex-snapshot
Convex polygons made from few lines and convex decompositions of polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_38openalex-snapshot
Parallel triangulation of nonconvex polytopes
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_27openalex-snapshot
Decomposition Algorithms in Geometry
inferred← citeshttps://doi.org/10.1007/978-3-030-23436-2_4openalex-snapshot
A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
inferred← citeshttps://doi.org/10.1007/978-3-319-28872-7_16openalex-snapshot
A Framework for Real-Time Multi-Contact Multi-Body Dynamic Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-87442-3_23openalex-snapshot
Optimal Accurate Minkowski Sum Approximation of Polyhedral Models
inferred← citeshttps://doi.org/10.1007/978-3-540-87473-7_23openalex-snapshot
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
inferred← citeshttps://doi.org/10.1007/978-3-642-55787-3_11openalex-snapshot
Simplification of Nonconvex Tetrahedral Meshes
inferred← citeshttps://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf02187840openalex-snapshot
On the difficulty of triangulating three-dimensional Nonconvex Polyhedra
inferred← citeshttps://doi.org/10.1007/bf02523191openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/bf02570716openalex-snapshot
Bounds on the size of tetrahedralizations
inferred← citeshttps://doi.org/10.1007/bf02736253openalex-snapshot
Overview and recent advances in natural neighbour galerkin methods
inferred← citeshttps://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
inferred← citeshttps://doi.org/10.1007/s00453-008-9219-6openalex-snapshot
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces
inferred← citeshttps://doi.org/10.1007/s00454-014-9624-3openalex-snapshot
Efficiently Hex-Meshing Things with Topology
inferred← citeshttps://doi.org/10.1007/s00454-016-9811-5openalex-snapshot
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes
inferred← citeshttps://doi.org/10.1007/s00454-024-00632-2openalex-snapshot
Decomposing the Complement of the Union of Cubes and Boxes in Three Dimensions
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00011-9openalex-snapshot
Optimal tetrahedralization of the 3D-region “between” a convex polyhedron and a convex polygon
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50020-1openalex-snapshot
Polyhedral Manifolds
inferred← citeshttps://doi.org/10.1016/j.cad.2014.07.005openalex-snapshot
Isogeometric segmentation: The case of contractible solids without non-convex edges
inferred← citeshttps://doi.org/10.1016/j.cad.2017.11.005openalex-snapshot
On tetrahedralisations of generalised Chazelle polyhedra with interior Steiner points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.03.001openalex-snapshot
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
inferred← citeshttps://doi.org/10.1016/j.crma.2003.12.033openalex-snapshot
Maillage simplicial d'un polyèdre arbitraire
inferred← citeshttps://doi.org/10.1016/j.finel.2009.06.017openalex-snapshot
Constrained Delaunay tetrahedral mesh generation and refinement
inferred← citeshttps://doi.org/10.1016/j.gmod.2014.03.013openalex-snapshot
Isogeometric segmentation. Part II: On the segmentability of contractible solids with non-convex edges
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.jcp.2018.04.044openalex-snapshot
An iterative interface reconstruction method for PLIC in general convex grids as part of a Coupled Level Set Volume of Fluid solver
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.11.022openalex-snapshot
Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.428openalex-snapshot
Domain Triangulation between Convex Polytopes
inferred← citeshttps://doi.org/10.1016/j.proeng.2016.11.013openalex-snapshot
On Tetrahedralisations of Reduced Chazelle Polyhedra with Interior Steiner Points
inferred← citeshttps://doi.org/10.1016/j.proeng.2017.09.802openalex-snapshot
A Cartesian Slab Based Multiblocking Strategy for Irregular Cylindrical Surfaces
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80059-5openalex-snapshot
Provably good mesh generation
inferred← citeshttps://doi.org/10.1016/s0045-7825(99)00030-4openalex-snapshot
Tetrahedral meshes from planar cross-sections
inferred← citeshttps://doi.org/10.1016/s0045-7949(96)00399-9openalex-snapshot
Optimization of tetrahedral meshes based on element shape measures
inferred← citeshttps://doi.org/10.1016/s0097-8493(02)00128-0openalex-snapshot
Polyhedral surface decomposition with applications
inferred← citeshttps://doi.org/10.1016/s0166-3615(99)00008-1openalex-snapshot
Tetrahedral mesh generation for solids based on alternating sum of volumes
inferred← citeshttps://doi.org/10.1016/s0168-874x(01)00051-8openalex-snapshot
3D anisotropic mesh refinement in compliance with a general metric specification
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/s0764-4442(97)86995-9openalex-snapshot
Triangulation sous contraintes en dimension quelconque
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00059-1openalex-snapshot
A decomposition-based approach to layered manufacturing☆☆A preliminary version of this paper appears in the Proceedings of the Seventh International Workshop on Algorithms and Data Structures, Providence, RI, 8–10 August 2001, LNCS 2125, pp. 389–400.
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00024-7openalex-snapshot
Strategies for polyhedral surface decomposition: An experimental study
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00024-2openalex-snapshot
Erased arrangements of lines and convex decompositions of polyhedra
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00026-1openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferred← citeshttps://doi.org/10.1023/b:joco.0000038910.06360.0aopenalex-snapshot
Minimal Tetrahedralizations of a Class of Polyhedra
inferred← citeshttps://doi.org/10.1108/ec-09-2023-0617openalex-snapshot
Generation of adaptive refinement tetrahedral meshes over domains of multi-chamber partition
inferred← citeshttps://doi.org/10.1109/20.124039openalex-snapshot
Universal generation of an initial mesh for adaptive 3-D finite element method
inferred← citeshttps://doi.org/10.1109/2945.817348openalex-snapshot
Partitioning 3D surface meshes using watershed segmentation
inferred← citeshttps://doi.org/10.1109/geoinformatics.2009.5293499openalex-snapshot
AHD: The alternate hierarchical decomposition of nonconvex polytopes (generalization of a convex polytope based spatial data model)
inferred← citeshttps://doi.org/10.1109/robot.1995.525666openalex-snapshot
Fast algorithms for penetration and contact determination between non-convex polyhedral models
inferred← citeshttps://doi.org/10.1109/tase.2013.2242327openalex-snapshot
Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact
inferred← citeshttps://doi.org/10.1109/tsmca.2008.2010793openalex-snapshot
Monotonic Indices Space Method and Its Application in the Capability Indices Effectiveness Analysis of a Notional Antistealth Information System
inferred← citeshttps://doi.org/10.1111/cgf.13323openalex-snapshot
Part‐Based Mesh Segmentation: A Survey
inferred← citeshttps://doi.org/10.1111/cgf.70120openalex-snapshot
Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data
inferred← citeshttps://doi.org/10.1137/0221025openalex-snapshot
Convex Decomposition of Polyhedra and Robustness
inferred← citeshttps://doi.org/10.1137/11085949xopenalex-snapshot
Efficient Implementation of Finite Element Methods on Nonmatching and Overlapping Meshes in Three Dimensions
inferred← citeshttps://doi.org/10.1142/s0218195912500070openalex-snapshot
SEARCHING POLYHEDRA BY ROTATING HALF-PLANES
inferred← citeshttps://doi.org/10.1142/s0218195914500034openalex-snapshot
TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS
inferred← citeshttps://doi.org/10.1145/109648.109689openalex-snapshot
Triangulation and CSG representation of polyhedra with arbitrary genus
inferred← citeshttps://doi.org/10.1145/142675.142720openalex-snapshot
Quality mesh generation in three dimensions
inferred← citeshttps://doi.org/10.1145/1477862.1477889openalex-snapshot
Haptic rendering of complex objects via directional sampling
inferred← citeshttps://doi.org/10.1145/160985.161174openalex-snapshot
Implementation of a motion planning system in three dimensions
inferred← citeshttps://doi.org/10.1145/220279.220311openalex-snapshot
Strategies for polyhedral surface decomposition
inferred← citeshttps://doi.org/10.1145/2462356.2462403openalex-snapshot
Efficiently hex-meshing things with topology
inferred← citeshttps://doi.org/10.1145/2629697openalex-snapshot
TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
inferred← citeshttps://doi.org/10.1145/3414685.3417776openalex-snapshot
Conforming weighted delaunay triangulations
inferred← citeshttps://doi.org/10.1145/73833.73875openalex-snapshot
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
inferred← citeshttps://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.24108/mathm.0118.0000098openalex-snapshot
Path Planning Methods in an Environment with Obstacles (A Review)
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4930openalex-snapshot
Geometric Problems in Robot Exploration
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.01766openalex-snapshot
Convex Decomposition of Polyhedrons Using Occlusion Relations Among Edges/Facets
inferred← citeshttps://doi.org/10.4236/ajor.2014.41004openalex-snapshot
Monotonic Vector Space Model (Ⅰ): Concepts and Operations
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.