On the public citation graph
The overlay of lower envelopes and its applications
0 signed · 117 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.1006/aima.1994.1056openalex-snapshot
Common Tangents and Common Transversals
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_8openalex-snapshot
Geometric Transversal Theory
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
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/bf02187733openalex-snapshot
The upper envelope of piecewise linear functions: Algorithms and applications
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187778openalex-snapshot
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
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/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.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/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/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
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.1145/177424.177624openalex-snapshot
Bounding the number of geometric permutations induced by k-transversals
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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.0988openalex-snapshot
Data Structures for Mobile Data
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/3-540-35589-8_53openalex-snapshot
Scale-Dependent Definitions of Gradient and Aspect and their Computation
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_46openalex-snapshot
Maintaining the extent of a moving point set
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-24767-8_11openalex-snapshot
Computing Largest Empty Slabs
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-77871-4_7openalex-snapshot
Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_4openalex-snapshot
Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol
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-16007-3_1openalex-snapshot
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
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/bf03167517openalex-snapshot
Voronoi diagrams with respect to criteria on vision information
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-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
inferred← citeshttps://doi.org/10.1007/s00453-010-9461-6openalex-snapshot
Shortest Paths in Time-Dependent FIFO Networks
inferred← citeshttps://doi.org/10.1007/s00454-001-0019-xopenalex-snapshot
Maintaining the Extent of a Moving Point Set
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-009-9139-5openalex-snapshot
On Overlays and Minimization Diagrams
inferred← citeshttps://doi.org/10.1007/s00454-010-9312-xopenalex-snapshot
On the Union of Cylinders in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-012-9401-0openalex-snapshot
Lines Avoiding Balls in Three Dimensions Revisited
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.1007/s004540010064openalex-snapshot
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s11786-010-0043-4openalex-snapshot
Arrangements on Parametric Surfaces II: Concretizations and Applications
inferred← citeshttps://doi.org/10.1007/s40314-022-02128-2openalex-snapshot
New approaches to the robust 1-center location problems on tree networks
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.2003.10.001openalex-snapshot
On the number of views of translates of a cube and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.002openalex-snapshot
Survivable minimum bottleneck networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101756openalex-snapshot
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.02.048openalex-snapshot
Locating an obnoxious plane
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.04.021openalex-snapshot
Facility location problems in the plane based on reverse nearest neighbor queries
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00023-6openalex-snapshot
Spheres, molecules, and hidden surface removal
inferred← citeshttps://doi.org/10.1109/focs.2008.25openalex-snapshot
On the Union of Cylinders in Three Dimensions
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/iccsa.2007.34openalex-snapshot
Security License Distribution Mechanism for Rights Delegation Models of Group Distribution between Consumers
inferred← citeshttps://doi.org/10.1109/iccsa.2007.50openalex-snapshot
Dynamic Software Adaptation with Dependence Analysis for Multi-Agent Platform
inferred← citeshttps://doi.org/10.1109/iccsa.2007.72openalex-snapshot
Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure
inferred← citeshttps://doi.org/10.1109/isvd.2007.44openalex-snapshot
Voronoi Diagram with Respect to Criteria on Vision Information
inferred← citeshttps://doi.org/10.1109/isvd.2009.20openalex-snapshot
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
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.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/1.9781611973075.73openalex-snapshot
Geometric optimization and sums of algebraic functions
inferred← citeshttps://doi.org/10.1137/s009753970240700xopenalex-snapshot
The Partition Technique for Overlays of Envelopes
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
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/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/1137856.1137914openalex-snapshot
On overlays and minimization diagrams
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferred← citeshttps://doi.org/10.1145/1810959.1810970openalex-snapshot
Lines avoiding balls in three dimensions revisited
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.220301openalex-snapshot
A new technique for analyzing substructures in arrangements
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/2525314.2525355openalex-snapshot
Sweeping a terrain by collaborative aerial vehicles
inferred← citeshttps://doi.org/10.1145/2532647openalex-snapshot
Geometric optimization and sums of algebraic functions
inferred← citeshttps://doi.org/10.1145/304893.304923openalex-snapshot
Geometric algorithms for trap design
inferred← citeshttps://doi.org/10.1145/3450626.3459769openalex-snapshot
Interactive modelling of volumetric musculoskeletal anatomy
inferred← citeshttps://doi.org/10.1145/3476576.3476691openalex-snapshot
Interactive modelling of volumetric musculoskeletal anatomy
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/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.14733/cadaps.2021.1000-1017openalex-snapshot
Convergence and Remeshing Criteria for Fitting Method Based on Iterative Reparameterization via Plane-Stress Model
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1018-1034openalex-snapshot
Repeatability and Accuracy of Laser Scanning-Based Reverse Engineering for Warped Composite Components
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1035-1049openalex-snapshot
Evaluation of User Preferences for 3D Modeling and Design Reviews in Virtual Reality
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1050-1060openalex-snapshot
Ramp Approach Parameter Correction Method for 3-axis Web Machining
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1080-1095openalex-snapshot
Shape Descriptor-Based Similar Feature Extraction for Finite Element Meshing
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1096-1110openalex-snapshot
Solid Model Similarity for Engineering Applications using Congruence of Triangles
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1111-1118openalex-snapshot
Layering Defects Detection in Laser Powder Bed Fusion using Embedded Vision System
inferred← citeshttps://doi.org/10.14733/cadaps.2021.1131-1145openalex-snapshot
Efficient Extraction of Information from Correlation Matrix for Product Design using an Integrated QFD-DEMATEL Method
inferred← citeshttps://doi.org/10.14733/cadaps.2021.900-913openalex-snapshot
Emotionally Intelligent Fashion Design Using CNN and GAN
inferred← citeshttps://doi.org/10.14733/cadaps.2021.914-953openalex-snapshot
Evolutionary Design Processes with Embedded Homeostatic Principles - Adaptation of Architectural Form and Skin to Excessive Solar Radiation
inferred← citeshttps://doi.org/10.14733/cadaps.2021.954-969openalex-snapshot
Multi-Kansei Qualities Optimization Design of Products Combined with Refined Kano Model and QFD
inferred← citeshttps://doi.org/10.14733/cadaps.2021.970-989openalex-snapshot
Function Model-based Generation of CAD Model Variants
inferred← citeshttps://doi.org/10.14733/cadaps.2021.990-999openalex-snapshot
Estimation of Surface Stresses on Voxel Meshes using Neuronal Nets on FEA Results in 2D Plane Stress Models
inferred← citeshttps://doi.org/10.14733/cadconfp.2021.283-287openalex-snapshot
Modeling Coverage Areas of Anisotropic Transmitters by Voronoi-like Structures
inferred← citeshttps://doi.org/10.3390/geometry2020005openalex-snapshot
A Theoretical Framework for Computing Generalized Weighted Voronoi Diagrams Based on Lower Envelopes
inferred← citeshttps://doi.org/10.48550/arxiv.2002.06752openalex-snapshot
Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem
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/545381.545401openalex-snapshot
Motorcycle graphs and straight skeletons
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.