On the public citation graph
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
0 signed · 86 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/jcss.1995.1018openalex-snapshot
Approximations and Optimal Geometric Divide-and-Conquer
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
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/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bf02573975openalex-snapshot
On ray shooting in convex polytopes
inferredcites →https://doi.org/10.1007/bf02574694openalex-snapshot
Higher-dimensional voronoi diagrams in linear expected time
inferredcites →https://doi.org/10.1007/bf02712873openalex-snapshot
Optimal output-sensitive convex hull algorithms in two and three dimensions
inferredcites →https://doi.org/10.1007/bf02712874openalex-snapshot
Output-sensitive results on convex hulls, extreme points, and related problems
inferredcites →https://doi.org/10.1016/0020-0190(73)90020-3openalex-snapshot
On the identification of the convex hull of a finite set of points in the plane
inferredcites →https://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferredcites →https://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/0925-7721(94)00018-qopenalex-snapshot
Derandomizing an output-sensitive convex hull algorithm in three dimensions
inferredcites →https://doi.org/10.1109/sfcs.1991.185399openalex-snapshot
A general approach to removing degeneracies
inferredcites →https://doi.org/10.1109/sfcs.1994.365724openalex-snapshot
Parallel algorithms for higher-dimensional convex hulls
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0215021openalex-snapshot
The Ultimate Planar Convex Hull Algorithm?
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0220016openalex-snapshot
An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
inferredcites →https://doi.org/10.1137/s0097539792235918openalex-snapshot
A General Approach to Removing Degeneracies
inferredcites →https://doi.org/10.1137/s0097539793254376openalex-snapshot
Dynamic Trees and Dynamic Point Location
inferredcites →https://doi.org/10.1142/s0129054190000072openalex-snapshot
PLANAR POINT LOCATION REVISITED
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/103418.103472openalex-snapshot
Dynamic trees and dynamic point location
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/142675.142734openalex-snapshot
Ray shooting in convex polytopes
inferredcites →https://doi.org/10.1145/237218.237347openalex-snapshot
On computing Voronoi diagrams by divide-prune-and-conquer
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
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.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5555/313651.313708openalex-snapshot
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.2318openalex-snapshot
Adaptive tetrahedral mesh generation by constrained Delaunay refinement
inferred← citeshttps://doi.org/10.1002/nme.3016openalex-snapshot
3D boundary recovery by constrained Delaunay tetrahedralization
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_43openalex-snapshot
In-Place Planar Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_44openalex-snapshot
The Level Ancestor Problem Simplified
inferred← citeshttps://doi.org/10.1007/978-1-4471-4817-3_5openalex-snapshot
Computation of Convex Hulls
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_18openalex-snapshot
On Some Proximity Problems of Colored Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_14openalex-snapshot
Synergistic Solutions for Merging and Computing Planar Convex Hulls
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_39openalex-snapshot
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_21openalex-snapshot
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms
inferred← citeshttps://doi.org/10.1007/b106657_6openalex-snapshot
Stability and Computation of Medial Axes - a State-of-the-Art Report
inferred← citeshttps://doi.org/10.1007/s00454-003-2824-xopenalex-snapshot
Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-004-1152-0openalex-snapshot
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
inferred← citeshttps://doi.org/10.1007/s00454-014-9629-yopenalex-snapshot
A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-015-9677-yopenalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/s00454-022-00476-8openalex-snapshot
Computing the Multicover Bifiltration
inferred← citeshttps://doi.org/10.1007/s10707-025-00538-yopenalex-snapshot
An in-place Quickhull algorithm
inferred← citeshttps://doi.org/10.1007/s10851-006-9004-6openalex-snapshot
A New Active Convex Hull Model for Image Regions
inferred← citeshttps://doi.org/10.1007/s11390-014-1475-0openalex-snapshot
On Some Proximity Problems of Colored Sets
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.cag.2004.08.012openalex-snapshot
Point cloud surfaces using geometric proximity graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.005openalex-snapshot
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.02.001openalex-snapshot
Convex hulls of spheres and convex hulls of disjoint convex polytopes
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.05.004openalex-snapshot
Space-efficient planar convex hull algorithms
inferred← citeshttps://doi.org/10.1109/focs.2009.34openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1109/isaf.2009.5307621openalex-snapshot
Fast Flaw Contour Recognition algorithm in online Plate Ultrasonic Testing
inferred← citeshttps://doi.org/10.1109/isvd.2006.30openalex-snapshot
Recent Developments and Open Problems in Voronoi Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539797325727openalex-snapshot
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems
inferred← citeshttps://doi.org/10.1142/9781860948534_0004openalex-snapshot
Finding the convex hull of a dense set
inferred← citeshttps://doi.org/10.1145/1137856.1137900openalex-snapshot
Engineering a compact parallel delaunay algorithm in 3D
inferred← citeshttps://doi.org/10.1145/1247069.1247116openalex-snapshot
The voronoi diagram of three lines
inferred← citeshttps://doi.org/10.1145/1998196.1998262openalex-snapshot
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
inferred← citeshttps://doi.org/10.1145/2261250.2261260openalex-snapshot
A fast and simple surface reconstruction algorithm
inferred← citeshttps://doi.org/10.1145/2462356.2462372openalex-snapshot
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
inferred← citeshttps://doi.org/10.1145/2582112.2582166openalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1145/3039242openalex-snapshot
A Fast and Simple Surface Reconstruction Algorithm
inferred← citeshttps://doi.org/10.1145/3046673openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1145/513400.513430openalex-snapshot
Optimally cutting a surface into a disk
inferred← citeshttps://doi.org/10.1145/566282.566304openalex-snapshot
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces
inferred← citeshttps://doi.org/10.1145/777792.777823openalex-snapshot
Complexity of the delaunay triangulation of points on surfaces the smooth case
inferred← citeshttps://doi.org/10.1145/777792.777824openalex-snapshot
Incremental constructions con BRIO
inferred← citeshttps://doi.org/10.22028/d291-26543openalex-snapshot
Toward better computation models for modern machines
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00184openalex-snapshot
Instance Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1702.08545openalex-snapshot
Synergistic Computation of Planar Maxima and Convex Hull
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.