On the public citation graph
Vertical decompositions for triangles in 3-space
0 signed · 84 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/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferredcites →https://doi.org/10.1007/bf02187734openalex-snapshot
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferredcites →https://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferredcites →https://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bfb0029813openalex-snapshot
Ray Shooting, Depth Orders and Hidden Surface Removal
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/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferredcites →https://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
inferredcites →https://doi.org/10.1090/dimacs/006/08openalex-snapshot
Algorithms in real algebraic geometry and applications to computational geometry
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1989.63541openalex-snapshot
Output-sensitive hidden surface removal
inferredcites →https://doi.org/10.1109/sfcs.1991.185371openalex-snapshot
Randomized multidimensional search trees: further results in dynamic sampling
inferredcites →https://doi.org/10.1109/sfcs.1993.366849openalex-snapshot
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
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/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1137/0221020openalex-snapshot
Efficient Point Location in a Convex Spatial Cell-Complex
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/103418.103471openalex-snapshot
Hidden surface removal with respect to a moving view point
inferredcites →https://doi.org/10.1145/103418.103472openalex-snapshot
Dynamic trees and dynamic point location
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
inferredcites →https://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10705474_10openalex-snapshot
Realistic Environment Models and Their Impact on the Exact Solution of the Motion Planning Problem
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_44openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferred← citeshttps://doi.org/10.1007/978-3-032-09970-9_22openalex-snapshot
Localization with Single or Antipodal Distance Measurements
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_11openalex-snapshot
Matching Polyhedral Terrains Using Overlays of Envelopes
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_41openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_5openalex-snapshot
Structure and Computation of Straight Skeletons in 3-Space
inferred← citeshttps://doi.org/10.1007/bf02712877openalex-snapshot
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
inferred← citeshttps://doi.org/10.1007/s00453-004-1107-0openalex-snapshot
Matching Polyhedral Terrains Using Overlays of Envelopes
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/s004539910025openalex-snapshot
A General Framework for Assembly Planning: The Motion Space Approach
inferred← citeshttps://doi.org/10.1007/s00454-003-2871-3openalex-snapshot
Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-009-9158-2openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space
inferred← citeshttps://doi.org/10.1007/s00454-023-00572-3openalex-snapshot
Throwing a Sofa Through the Window
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/j.cad.2004.01.004openalex-snapshot
Fast swept volume approximation of complex polyhedral models
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.003openalex-snapshot
Counting and representing intersections among triangles in three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.06.003openalex-snapshot
Translational packing of arbitrary polytopes
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00023-6openalex-snapshot
Spheres, molecules, and hidden surface removal
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.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959880openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1109/svv.1998.729589openalex-snapshot
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2010.01770.xopenalex-snapshot
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
inferred← citeshttps://doi.org/10.1137/s0097539704444245openalex-snapshot
Output-Sensitive Construction of the Union of Triangles
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1145/1017460.1017461openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1145/195058.195112openalex-snapshot
On point location and motion planning among simplices
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/276884.276886openalex-snapshot
A general framework for assembly planning
inferred← citeshttps://doi.org/10.1145/288126.288170openalex-snapshot
An exact interactive time visibility ordering algorithm for polyhedral cell complexes
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/513400.513437openalex-snapshot
Improved construction of vertical decompositions of three-dimensional arrangements
inferred← citeshttps://doi.org/10.1145/781606.781613openalex-snapshot
Fast swept volume approximation of complex polyhedral models
inferred← citeshttps://doi.org/10.1145/997817.997851openalex-snapshot
Counting and representing intersections among triangles in three dimensions
inferred← citeshttps://doi.org/10.1163/156855397x00281openalex-snapshot
Assembly partitioning along simple paths: the case of multiple translations
inferred← citeshttps://doi.org/10.1177/027836402320556412openalex-snapshot
Robust Geometric Computing in Motion
inferred← citeshttps://doi.org/10.1177/02783649922066222openalex-snapshot
Caging Planar Bodies by One-Parameter Two-Fingered Gripping Systems
inferred← citeshttps://doi.org/10.5555/982792.982852openalex-snapshot
Output-sensitive construction of the union of triangles
inferred← citeshttps://doi.org/10.70675/cd706d0dz2107z46a2za552zb472e8e4f7f1openalex-snapshot
Analyse de maillages 3D par morphologie mathématique
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.