On the public citation graph
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
0 signed · 88 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/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/bf02574373openalex-snapshot
On the number of views of polyhedral terrains
inferredcites →https://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
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.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.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferredcites →https://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
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.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
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.2001.1189openalex-snapshot
Fly Cheaply: On the Minimum Fuel Consumption Problem
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/11944836_11openalex-snapshot
Computing a Center-Transversal Line
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-642-21931-3_2openalex-snapshot
An Optimal Hidden-Surface Algorithm and Its Parallelization
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/bf02570714openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
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/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/pl00009383openalex-snapshot
Notes on the complexity of exact view graph algorithms for piecewise smooth Algebraic Surfaces
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/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-006-1278-3openalex-snapshot
Lines Tangent to Four Triangles in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1007/s00454-012-9414-8openalex-snapshot
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-013-9512-2openalex-snapshot
On Topological Changes in the Delaunay Triangulation of Moving Points
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/j.comgeo.2015.10.009openalex-snapshot
Computing the geodesic centers of a polygonal domain
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2013.09.004openalex-snapshot
Football analysis using spatio-temporal tools
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.013openalex-snapshot
Unreliable point facility location problems on networks
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/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/isvd.2010.12openalex-snapshot
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366835openalex-snapshot
The union of convex polyhedra in three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher 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/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/s0097539705447116openalex-snapshot
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
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.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/1174429.1174450openalex-snapshot
Oriented convex polyhedra for collision detection in 3D computer animation
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.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferred← citeshttps://doi.org/10.1145/1810959.1810969openalex-snapshot
On the complexity of sets of free lines and line segments among balls in three dimensions
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/2261250.2261252openalex-snapshot
On topological changes in the delaunay triangulation of moving points
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/320211.320240openalex-snapshot
New results on quantifier elimination over real closed fields and applications to constraint databases
inferred← citeshttps://doi.org/10.1145/3555985openalex-snapshot
An Improved Bound for Weak Epsilon-nets in the Plane
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.20382/jocg.v9i1a5openalex-snapshot
On the Geodesic Centers of Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.0812.0607openalex-snapshot
Dilation, smoothed distance, and minimization diagrams of convex functions
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07214openalex-snapshot
Computing the Geodesic Centers of a Polygonal Domain
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.