On the public citation graph
The upper envelope of piecewise linear functions: Algorithms and applications
0 signed · 149 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-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
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/bf02187734openalex-snapshot
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
inferredcites →https://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferredcites →https://doi.org/10.1007/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02187878openalex-snapshot
Computing convolutions by reciprocal search
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
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/0166-218x(90)90127-xopenalex-snapshot
Algorithms for high dimensional stabbing problems
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferredcites →https://doi.org/10.1093/comjnl/20.4.364openalex-snapshot
An efficient algorithm for a complete link method
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
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/0401038openalex-snapshot
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
inferredcites →https://doi.org/10.1145/10515.10544openalex-snapshot
Quadratic bounds for hidden line elimination
inferredcites →https://doi.org/10.1145/27625.27627openalex-snapshot
Worst-case optimal hidden-surface removal
inferredcites →https://doi.org/10.1145/356625.356626openalex-snapshot
A Characterization of Ten Hidden-Surface Algorithms
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1145/73393.73423openalex-snapshot
On the general motion planning problem with two degrees of freedom
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/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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.1007/3-540-19488-6_117openalex-snapshot
Geometric structures in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_45openalex-snapshot
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_16openalex-snapshot
Weighted orthogonal linear L ∞-approximation and applications
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_187openalex-snapshot
Linear approximation of simple objects
inferred← citeshttps://doi.org/10.1007/3-540-60392-1_18openalex-snapshot
Updating visibility information on multiresolut ion terrain models
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_27openalex-snapshot
Map of Geometric Minimal Cuts with Applications*
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_27-1openalex-snapshot
Map of Geometric Minimal Cuts with Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_3openalex-snapshot
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_23openalex-snapshot
Farthest Color Voronoi Diagrams: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_40openalex-snapshot
Searching Edges in the Overlap of Two Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_27openalex-snapshot
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_6openalex-snapshot
Minimum-Width Square Annulus Intersecting Polygons
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-28629-5_57openalex-snapshot
Efficient View Point Selection for Silhouettes of Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_38openalex-snapshot
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-74477-1_5openalex-snapshot
Determining the Visibility of a Planar Set of Line Segments in ${\mathcal{O}(n\log\log n)}$ Time
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_31openalex-snapshot
Kinetic Maintenance of Mobile k-Centres on Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_26openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_18openalex-snapshot
Generalizing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_4openalex-snapshot
Voronoi Diagram with Visual Restriction
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_9openalex-snapshot
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_8openalex-snapshot
Geometric Transversal Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_22openalex-snapshot
Stabbing Circles for Sets of Segments in the Plane
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/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/bf02187734openalex-snapshot
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
inferred← citeshttps://doi.org/10.1007/bf02189323openalex-snapshot
The upper envelope of voronoi surfaces and its applications
inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1007/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferred← citeshttps://doi.org/10.1007/pl00009193openalex-snapshot
Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1007/pl00009348openalex-snapshot
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
inferred← citeshttps://doi.org/10.1007/s00453-004-1095-0openalex-snapshot
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
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-012-9704-9openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/s00453-016-0118-yopenalex-snapshot
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/s00453-017-0299-zopenalex-snapshot
Stabbing Circles for Sets of Segments in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-025-01311-1openalex-snapshot
The Farthest Color Voronoi Diagram in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-016-9841-zopenalex-snapshot
Computing the $$L_1$$ Geodesic Diameter and Center of a Polygonal Domain
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/s10479-023-05402-6openalex-snapshot
Optimization of battery management in telecommunications networks under energy market incentives
inferred← citeshttps://doi.org/10.1007/s10878-018-0347-xopenalex-snapshot
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
inferred← citeshttps://doi.org/10.1007/s11241-016-9259-yopenalex-snapshot
Optimizing resource speed for two-stage real-time tasks
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90155-5openalex-snapshot
Lower bounds for line stabbing
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90127-xopenalex-snapshot
Algorithms for high dimensional stabbing problems
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90113-3openalex-snapshot
Orthogonal weighted linear L1 and L∞ approximation and applications
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90015-9openalex-snapshot
Linear approximation of simple objects
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-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
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/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.artint.2012.09.007openalex-snapshot
Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.12.004openalex-snapshot
Stabbers of line segments in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.04.001openalex-snapshot
Efficient view point selection for silhouettes of convex polyhedra
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102173openalex-snapshot
Minimum-width double-slabs and widest empty slabs in high dimensions
inferred← citeshttps://doi.org/10.1016/j.dam.2008.10.006openalex-snapshot
Kinetic maintenance of mobile k -centres on trees
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/j.jda.2006.03.014openalex-snapshot
Parameterized matching with mismatches
inferred← citeshttps://doi.org/10.1016/j.orl.2019.07.006openalex-snapshot
Computing a minimum-width cubic and hypercubic shell
inferred← citeshttps://doi.org/10.1016/j.orp.2024.100299openalex-snapshot
Pareto-optimal front generation for the bi-objective JIT scheduling problems with a piecewise linear trade-off between objectives
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.008openalex-snapshot
Voronoi diagram with visual restriction
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115345openalex-snapshot
Largest convex hulls for convex-hull disjoint clusters with bounded size
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00179-4openalex-snapshot
Optimal computation of the Voronoi diagram of disjoint clusters
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00608-2openalex-snapshot
Remarks on the computation of the horizon of a digital terrain
inferred← citeshttps://doi.org/10.1016/s0960-0779(02)00409-5openalex-snapshot
Reaction–diffusion path planning in a hybrid chemical and cellular-automaton processor
inferred← citeshttps://doi.org/10.1023/a:1004886722459openalex-snapshot
HYPERPLANE TRANSVERSALS OF HOMOTHETICAL, CENTRALLY SYMMETRIC POLYTOPES
inferred← citeshttps://doi.org/10.1023/a:1009708413602openalex-snapshot
Visibility Computations on Hierarchical Triangulated Terrain Models
inferred← citeshttps://doi.org/10.1080/02693799408901985openalex-snapshot
Visibility algorithms on triangulated digital terrain models
inferred← citeshttps://doi.org/10.1080/02693799408902019openalex-snapshot
Parallelizing visibility computations on triangulated terrains
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/date.2008.4484672openalex-snapshot
Parametric Throughput Analysis of Synchronous Data Flow Graphs
inferred← citeshttps://doi.org/10.1109/icpp.2006.5openalex-snapshot
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2011.17openalex-snapshot
The $L_\infty$ Hausdorff Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1109/isvd.2013.11openalex-snapshot
Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input
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/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
inferred← citeshttps://doi.org/10.1142/s0129054109006425openalex-snapshot
CONSTRUCTING OPTIMAL HIGHWAYS
inferred← citeshttps://doi.org/10.1142/s0218195904001536openalex-snapshot
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
inferred← citeshttps://doi.org/10.1142/s0218195915500089openalex-snapshot
The L∞ Hausdorff Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1142/s0218195992000238openalex-snapshot
COMPUTING SHORTEST TRANSVERSALS OF SETS
inferred← citeshttps://doi.org/10.1142/s0218195998000047openalex-snapshot
An Output-Sensitive Convex Hull Algorithm for Planar Objects
inferred← citeshttps://doi.org/10.1145/109648.109656openalex-snapshot
Computing shortest transversals of sets (extended abstract)
inferred← citeshttps://doi.org/10.1145/109648.109670openalex-snapshot
The upper envelope of Voronoi surfaces and its applications
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/126546.126548openalex-snapshot
On the Peeper's Voronoi diagram
inferred← citeshttps://doi.org/10.1145/1403375.1403407openalex-snapshot
Parametric throughput analysis of synchronous data flow graphs
inferred← citeshttps://doi.org/10.1145/159730.159732openalex-snapshot
Separating and intersecting spherical polygons
inferred← citeshttps://doi.org/10.1145/162754.162942openalex-snapshot
Algorithms for visibility computation on digital terrain models
inferred← citeshttps://doi.org/10.1145/177424.177445openalex-snapshot
On translational motion planning in 3-space
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.220331openalex-snapshot
A global motion planner for a mobile robot on a terrain
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/73393.73430openalex-snapshot
Skewed projections with an application to line stabbing in R3
inferred← citeshttps://doi.org/10.1145/73393.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
inferred← citeshttps://doi.org/10.1145/73833.73873openalex-snapshot
Stabbing pairwise disjoint translates in linear time
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.1145/98524.98542openalex-snapshot
The combinatorial complexity of hyperplane transversals
inferred← citeshttps://doi.org/10.1145/98524.98599openalex-snapshot
Computing the minimum Hausdorff distance for point sets under translation
inferred← citeshttps://doi.org/10.1587/transfun.2025dmp0005openalex-snapshot
One-Dimensional Higher-Order Color Voronoi Diagrams
inferred← citeshttps://doi.org/10.22215/etd/2006-08509openalex-snapshot
Parallel Voronoi diagrams for VLSI design
inferred← citeshttps://doi.org/10.22215/etd/2014-10404openalex-snapshot
Obstacle-Avoiding Path Existence Queries in a Simple Polygon
inferred← citeshttps://doi.org/10.24963/ijcai.2018/15openalex-snapshot
Non-decreasing Payment Rules for Combinatorial Auctions
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5838openalex-snapshot
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02229openalex-snapshot
Searching edges in the overlap of two plane graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11847openalex-snapshot
Faster Algorithms for Parametric Global Minimum Cut Problems
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.314633openalex-snapshot
The subtree max gap problem with application to parallel string covering
inferred← citeshttps://doi.org/10.5555/642992.642999openalex-snapshot
Penetration depth of two convex polytopes in 3D
inferred← citeshttps://doi.org/10.6100/ir635718openalex-snapshot
Timing analysis of synchronous data flow graphs
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.