On the public citation graph
Almost tight upper bounds for lower envelopes in higher dimensions
0 signed · 169 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-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
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/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferredcites →https://doi.org/10.1007/bf02574373openalex-snapshot
On the number of views of polyhedral terrains
inferredcites →https://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferredcites →https://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
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/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
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/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/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
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.1142/s0218195991000037openalex-snapshot
VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferredcites →https://doi.org/10.1145/177424.177436openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferredcites →https://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferredcites →https://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1998.0957openalex-snapshot
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
inferred← citeshttps://doi.org/10.1006/jagm.1998.0988openalex-snapshot
Data Structures for Mobile Data
inferred← citeshttps://doi.org/10.1007/11841036_70openalex-snapshot
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_25openalex-snapshot
Casting a Polyhedron with Directional Uncertainty
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-47738-1_28openalex-snapshot
On the complexity of the union of geometric objects
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/978-3-319-27863-6_71openalex-snapshot
Computing Voronoi Diagrams of Line Segments in ℝ K in O(n log n) Time
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-69733-6_35openalex-snapshot
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_13openalex-snapshot
Straight Skeletons of Three-Dimensional Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_106openalex-snapshot
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_34openalex-snapshot
Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1007/978-3-642-22619-9_3openalex-snapshot
On Multiplicatively Weighted Voronoi Diagrams for Lines in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_59openalex-snapshot
The Offset Filtration of Convex Objects
inferred← citeshttps://doi.org/10.1007/bf02570714openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1007/bf02574373openalex-snapshot
On the number of views of polyhedral terrains
inferred← citeshttps://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferred← citeshttps://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
inferred← citeshttps://doi.org/10.1007/bf02712871openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
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/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf02716806openalex-snapshot
On voronoi diagrams in theL p-metric in ℝD
inferred← citeshttps://doi.org/10.1007/bfb0009487openalex-snapshot
Computing fair and bottleneck matchings in geometric graphs
inferred← citeshttps://doi.org/10.1007/pl00009319openalex-snapshot
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces
inferred← citeshttps://doi.org/10.1007/pl00009366openalex-snapshot
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions
inferred← citeshttps://doi.org/10.1007/pl00009427openalex-snapshot
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00366-015-0420-3openalex-snapshot
Smooth anisotropic sources with application to three-dimensional surface mesh generation
inferred← citeshttps://doi.org/10.1007/s00453-001-0016-8openalex-snapshot
Geometry Helps in Bottleneck Matching and Related Problems
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-025-01368-yopenalex-snapshot
The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination
inferred← citeshttps://doi.org/10.1007/s00454-003-2950-5openalex-snapshot
Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-006-1263-xopenalex-snapshot
On the Union of κ-Round Objects in Three and Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-006-1272-9openalex-snapshot
A Single Cell in an Arrangement of Convex Polyhedra in ${\Bbb R}^3$
inferred← citeshttps://doi.org/10.1007/s00454-009-9139-5openalex-snapshot
On Overlays and Minimization Diagrams
inferred← citeshttps://doi.org/10.1007/s00454-009-9173-3openalex-snapshot
The Voronoi Diagram of Three Lines
inferred← citeshttps://doi.org/10.1007/s00454-015-9675-0openalex-snapshot
On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams
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-022-00473-xopenalex-snapshot
Faster Algorithms for Largest Empty Rectangles and Boxes
inferred← citeshttps://doi.org/10.1007/s00454-023-00492-2openalex-snapshot
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s004540010064openalex-snapshot
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s42979-026-05225-9openalex-snapshot
The Tight Backbone Spread Model for Simulating 3D Epithelial Cell Layer Dynamics
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00007-0openalex-snapshot
On-line construction of the upper envelope of triangles and surface patches in three dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/j.automatica.2013.04.013openalex-snapshot
Optimal partitioning for spatiotemporal coverage in a drift field
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.012openalex-snapshot
Querying two boundary points for shortest paths in a polygonal domain
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.002openalex-snapshot
Survivable minimum bottleneck networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.10.009openalex-snapshot
Computing the geodesic centers of a polygonal domain
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102101openalex-snapshot
An analytical representation of the 2d generalized balanced power diagram
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.013openalex-snapshot
Unreliable point facility location problems on networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.01.003openalex-snapshot
The multicriteria p-facility median location problem on networks
inferred← citeshttps://doi.org/10.1016/j.jcp.2020.109855openalex-snapshot
Anisotropic sources for surface and volume boundary layer mesh generation
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00336-2openalex-snapshot
A lower bound on Voronoi diagram complexity
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00049-5openalex-snapshot
Linear approximation of simple objects
inferred← citeshttps://doi.org/10.1016/s0723-0869(04)80009-4openalex-snapshot
The geometry of minkowski spaces — A survey. Part II
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00167-0openalex-snapshot
Casting a polyhedron with directional uncertainty
inferred← citeshttps://doi.org/10.1080/10556789808805714openalex-snapshot
Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1090/conm/453/08808openalex-snapshot
Line problems in nonlinear computational geometry
inferred← citeshttps://doi.org/10.1109/comst.2017.2786748openalex-snapshot
A Survey on Quantum Channel Capacities
inferred← citeshttps://doi.org/10.1109/focs.2013.62openalex-snapshot
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions
inferred← citeshttps://doi.org/10.1109/focs.2018.00030openalex-snapshot
An Improved Bound for Weak Epsilon-Nets in the Plane
inferred← citeshttps://doi.org/10.1109/icmlc.2010.5580811openalex-snapshot
Discrete construction of Voronoi diagrams for cross generators
inferred← citeshttps://doi.org/10.1109/isvd.2006.30openalex-snapshot
Recent Developments and Open Problems in Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2013.15openalex-snapshot
On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646093openalex-snapshot
An improved algorithm for quantifier elimination over real closed fields
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/sfcs.2002.1181989openalex-snapshot
The partition technique for overlays of envelopes
inferred← citeshttps://doi.org/10.1137/080744694openalex-snapshot
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
inferred← citeshttps://doi.org/10.1137/090765092openalex-snapshot
Semialgebraic Range Reporting and Emptiness Searching with Applications
inferred← citeshttps://doi.org/10.1137/1.9781611975482.23openalex-snapshot
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
inferred← citeshttps://doi.org/10.1137/s009753970240700xopenalex-snapshot
The Partition Technique for Overlays of Envelopes
inferred← citeshttps://doi.org/10.1137/s0097539702408387openalex-snapshot
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539793252080openalex-snapshot
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferred← citeshttps://doi.org/10.1137/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
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.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1142/s0218195905001841openalex-snapshot
COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
inferred← citeshttps://doi.org/10.1142/s0218195910003396openalex-snapshot
VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE
inferred← citeshttps://doi.org/10.1142/s0218195919500079openalex-snapshot
Weighted Voronoi Diagrams in the Maximum Norm
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/1064092.1064099openalex-snapshot
Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3
inferred← citeshttps://doi.org/10.1145/1137856.1137914openalex-snapshot
On overlays and minimization diagrams
inferred← citeshttps://doi.org/10.1145/1247069.1247116openalex-snapshot
The voronoi diagram of three lines
inferred← citeshttps://doi.org/10.1145/1542362.1542384openalex-snapshot
Straight skeletons of three-dimensional polyhedra
inferred← citeshttps://doi.org/10.1145/160985.160989openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferred← citeshttps://doi.org/10.1145/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1145/177424.177436openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1145/177424.177574openalex-snapshot
Spheres, molecules, and hidden surface removal
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
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/220279.220288openalex-snapshot
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
inferred← citeshttps://doi.org/10.1145/220279.220299openalex-snapshot
The overlay of lower envelopes in three dimensions and its applications
inferred← citeshttps://doi.org/10.1145/220279.220301openalex-snapshot
A new technique for analyzing substructures in arrangements
inferred← citeshttps://doi.org/10.1145/220279.220314openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferred← citeshttps://doi.org/10.1145/235666.571627openalex-snapshot
Computational Geometry Column 29
inferred← citeshttps://doi.org/10.1145/237218.237230openalex-snapshot
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications
inferred← citeshttps://doi.org/10.1145/2582112.2582158openalex-snapshot
On the Complexity of Randomly Weighted Voronoi Diagrams
inferred← citeshttps://doi.org/10.1145/2582112.2582171openalex-snapshot
Continuously Flattening Polyhedra Using Straight Skeletons
inferred← citeshttps://doi.org/10.1145/262839.262911openalex-snapshot
On the complexity of the union of fat objects in the plane
inferred← citeshttps://doi.org/10.1145/304893.304923openalex-snapshot
Geometric algorithms for trap design
inferred← citeshttps://doi.org/10.1145/320211.320240openalex-snapshot
New results on quantifier elimination over real closed fields and applications to constraint databases
inferred← citeshttps://doi.org/10.1145/3406325.3451062openalex-snapshot
Stronger bounds for weak epsilon-nets in higher dimensions
inferred← citeshttps://doi.org/10.1145/3555985openalex-snapshot
An Improved Bound for Weak Epsilon-nets in the Plane
inferred← citeshttps://doi.org/10.1145/3802821openalex-snapshot
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
inferred← citeshttps://doi.org/10.1145/380752.380815openalex-snapshot
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
inferred← citeshttps://doi.org/10.1145/513400.513427openalex-snapshot
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations
inferred← citeshttps://doi.org/10.1145/513400.513428openalex-snapshot
Polyhedral Voronoi diagrams of polyhedra in three dimensions
inferred← citeshttps://doi.org/10.1145/777792.777822openalex-snapshot
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
inferred← citeshttps://doi.org/10.1145/997817.997875openalex-snapshot
On the union of κ-round objects
inferred← citeshttps://doi.org/10.11606/d.45.2000.tde-20210729-205459openalex-snapshot
Geometria computacional de pontos em movimento
inferred← citeshttps://doi.org/10.14288/1.0051704openalex-snapshot
All the distant horizon edges of a terrain
inferred← citeshttps://doi.org/10.2514/6.2015-1507openalex-snapshot
Ensuring a smooth transition from semi-structured surface boundary layer mesh to fully unstructured anisotropic surface mesh
inferred← citeshttps://doi.org/10.33540/1991openalex-snapshot
On Geometric Measures and Their Computation
inferred← citeshttps://doi.org/10.48550/arxiv.0803.3109openalex-snapshot
Voronoi Diagrams for Quantum States and Its Application to a Numerical Estimation of a Quantum Channel Capacity
inferred← citeshttps://doi.org/10.48550/arxiv.0805.0022openalex-snapshot
Straight Skeletons of Three-Dimensional Polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.0911.5017openalex-snapshot
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
inferred← citeshttps://doi.org/10.48550/arxiv.1401.1477openalex-snapshot
On the Complexity of Randomly Weighted Voronoi Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07214openalex-snapshot
Computing the Geodesic Centers of a Polygonal Domain
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.5555/1070432.1070452openalex-snapshot
The interface between computational and combinatorial geometry
inferred← citeshttps://doi.org/10.5555/1070432.1070504openalex-snapshot
Ray shooting amid balls, farthest point from a line, and range emptiness searching
inferred← citeshttps://doi.org/10.5555/314161.314368openalex-snapshot
Line transversals of balls and smallest enclosing cylinders in three dimensions
inferred← citeshttps://doi.org/10.5555/314464.314482openalex-snapshot
A near-linear algorithm for the planar segment center problem
inferred← citeshttps://doi.org/10.5555/3310435.3310458openalex-snapshot
Approximate nearest neighbor searching with non-euclidean and weighted distances
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.