On the public citation graph
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
0 signed · 296 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.1002/cpa.3160390402openalex-snapshot
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
inferredcites →https://doi.org/10.1007/3-540-08353-7_166openalex-snapshot
The medial axis of a simple polygon
inferredcites →https://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
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/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0031-3203(84)90064-5openalex-snapshot
An optimal algorithm for constructing the weighted voronoi diagram in the plane
inferredcites →https://doi.org/10.1016/0196-6774(85)90021-5openalex-snapshot
A “retraction” method for planning the motion of a disc
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/tpami.1982.4767267openalex-snapshot
Medial Axis Transformation of a Planar Shape
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0214006openalex-snapshot
Voronoi Diagram in the Laguerre Geometry and Its Applications
inferredcites →https://doi.org/10.1137/0214034openalex-snapshot
Intersection and Closest-Pair Problems for a Set of Planar Discs
inferredcites →https://doi.org/10.1145/10515.10549openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1145/22145.22158openalex-snapshot
Stable prehension with three fingers
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.14288/1.0051821openalex-snapshot
A convex hull algorithm optimal for point sets in even dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcph.1999.6194openalex-snapshot
Semi-Lagrangian Methods for Level Set Equations
inferred← citeshttps://doi.org/10.1006/jcph.1999.6205openalex-snapshot
Tree Methods for Moving Interfaces
inferred← citeshttps://doi.org/10.1006/jcph.1999.6259openalex-snapshot
Fast Tree-Based Redistancing for Level Set Computations
inferred← citeshttps://doi.org/10.1006/jcph.2002.7028openalex-snapshot
Rapid and Accurate Computation of the Distance Function Using Grids
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1051openalex-snapshot
Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_45openalex-snapshot
What can be parallelized in computational geometry?
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_137openalex-snapshot
Moving discs between polygons
inferred← citeshttps://doi.org/10.1007/3-540-44808-x_8openalex-snapshot
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_32openalex-snapshot
On Some Optimization Problems in Obnoxious Facility Location
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_82openalex-snapshot
Graph Voronoi Regions for Interfacing Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_83openalex-snapshot
Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_23openalex-snapshot
2-Point Site Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_24openalex-snapshot
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_3openalex-snapshot
Constructing the Voronoi diagram of a set of line segments in parallel
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_31openalex-snapshot
Motion planning in the CL-environment
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_24openalex-snapshot
k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_17openalex-snapshot
Dynamic Voronoi diagrams in motion planning
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_186openalex-snapshot
A plane-sweep algorithm for finding a closest pair among convex planar objects
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_19openalex-snapshot
Resemblance and symmetries of geometric patterns
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_259openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_261openalex-snapshot
A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_270openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferred← citeshttps://doi.org/10.1007/3-540-57322-4_8openalex-snapshot
On mathematical modeling in robotics
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_161openalex-snapshot
Hamiltonian abstract Voronoi diagrams in linear time
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_144openalex-snapshot
Straight skeletons for general polygonal figures in the plane
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_77openalex-snapshot
Computing constrained minimum-width annuli of point sets
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_27openalex-snapshot
Decomposition Algorithms in Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_7openalex-snapshot
Parallel Randomized Techniques for Some Fundamental Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_34openalex-snapshot
Does a Robot Path Have Clearance C?
inferred← citeshttps://doi.org/10.1007/978-3-030-31866-6_79openalex-snapshot
An Optimal Path Planning Proposal for Motion Robots with Specific Constraints Applicable in Biomedical Engineering
inferred← citeshttps://doi.org/10.1007/978-3-030-48981-6_2openalex-snapshot
Introduction to Mobile Robots Navigation, Localization and Mapping
inferred← citeshttps://doi.org/10.1007/978-3-319-10653-3_2openalex-snapshot
Morphological Image Analysis for Computer Vision Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_12openalex-snapshot
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-319-42432-3_66openalex-snapshot
Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_3openalex-snapshot
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
inferred← citeshttps://doi.org/10.1007/978-3-319-68155-9_2openalex-snapshot
Surrounding Join Query Processing in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_12openalex-snapshot
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_33openalex-snapshot
Computational and Structural Advantages of Circular Boundary Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_39openalex-snapshot
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
inferred← citeshttps://doi.org/10.1007/978-3-642-10649-1_21openalex-snapshot
On the Structure of Straight Skeletons
inferred← citeshttps://doi.org/10.1007/978-3-642-17452-0_2openalex-snapshot
An Equivalence Relation for Local Path Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_29openalex-snapshot
Improved Algorithms for Farthest Colored Voronoi Diagram of Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_42openalex-snapshot
Motion Planning via Manifold Samples
inferred← citeshttps://doi.org/10.1007/978-3-642-24999-0_62openalex-snapshot
The Bisector of a Point and a Plane Algebraic Curve
inferred← citeshttps://doi.org/10.1007/978-3-642-25249-5_1openalex-snapshot
Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_7openalex-snapshot
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-29793-9_13openalex-snapshot
(α, δ)-Sleeves for Reconstruction of Rectilinear Building Facets
inferred← citeshttps://doi.org/10.1007/978-3-642-31125-3_17openalex-snapshot
DEM Interpolation from Contours Using Medial Axis Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_21openalex-snapshot
On Higher Order Voronoi Diagrams of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
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/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/978-4-431-68456-5_26openalex-snapshot
A Fast Incremental Algorithm for Computing the Voronoi Diagram of a Planar Shape
inferred← citeshttps://doi.org/10.1007/bf00123352openalex-snapshot
Voronoi diagrams of polygons: A framework for shape representation
inferred← citeshttps://doi.org/10.1007/bf00181613openalex-snapshot
Geometric relations among Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf01188708openalex-snapshot
Constructing the Voronoi diagram of a set of line segments in parallel
inferred← citeshttps://doi.org/10.1007/bf01188709openalex-snapshot
Duality of constrained Voronoi diagrams and Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01293668openalex-snapshot
Finding a closest visible vertex pair between two polygons
inferred← citeshttps://doi.org/10.1007/bf01530830openalex-snapshot
Approximate matching of polygonal shapes
inferred← citeshttps://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1007/bf01553881openalex-snapshot
Constrained delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferred← citeshttps://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
inferred← citeshttps://doi.org/10.1007/bf02187695openalex-snapshot
Generalized delaunay triangulation for planar graphs
inferred← citeshttps://doi.org/10.1007/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02189323openalex-snapshot
The upper envelope of voronoi surfaces and its applications
inferred← citeshttps://doi.org/10.1007/bf02716580openalex-snapshot
A compact piecewise-linear voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1007/bf03167582openalex-snapshot
Disk packing for the estimation of the size of a wire bundle
inferred← citeshttps://doi.org/10.1007/bfb0039594openalex-snapshot
Geometric relations among Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bfb0049411openalex-snapshot
How to compute the Voronoi diagram of line segments: Theoretical and experimental results
inferred← citeshttps://doi.org/10.1007/bfb0054355openalex-snapshot
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
inferred← citeshttps://doi.org/10.1007/bfb0113277openalex-snapshot
Dynamic voronoi diagrams in motion planning
inferred← citeshttps://doi.org/10.1007/pl00008263openalex-snapshot
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
inferred← citeshttps://doi.org/10.1007/pl00009429openalex-snapshot
Finding the Medial Axis of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1007/s002000100086openalex-snapshot
Semilinear Motion Planning in REDLOG
inferred← citeshttps://doi.org/10.1007/s00366-012-0256-zopenalex-snapshot
A local adaptation-based generation method of medial axis for efficient engineering analysis
inferred← citeshttps://doi.org/10.1007/s00371-011-0581-zopenalex-snapshot
Dynamic Voronoi diagram of complex sites
inferred← citeshttps://doi.org/10.1007/s00453-021-00824-9openalex-snapshot
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00454-004-1098-2openalex-snapshot
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-005-1192-0openalex-snapshot
The Voronoi Diagram of Curved Objects
inferred← citeshttps://doi.org/10.1007/s00454-010-9269-9openalex-snapshot
Conformal Mapping in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-012-9441-5openalex-snapshot
Deconstructing Approximate Offsets
inferred← citeshttps://doi.org/10.1007/s00454-022-00404-wopenalex-snapshot
How to Cut Corners and Get Bounded Convex Curvature
inferred← citeshttps://doi.org/10.1007/s10852-010-9142-0openalex-snapshot
Maximizing Voronoi Regions of a Set of Points Enclosed in a Circle with Applications to Facility Location
inferred← citeshttps://doi.org/10.1007/s10898-021-01002-5openalex-snapshot
Near optimal minimal convex hulls of disks
inferred← citeshttps://doi.org/10.1007/s11786-012-0111-zopenalex-snapshot
On Computing the Convex Hull of (Piecewise) Curved Objects
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90053-7openalex-snapshot
A survey of motion planning and related geometric algorithms
inferred← citeshttps://doi.org/10.1016/0010-4485(94)90042-6openalex-snapshot
Pocket machining based on contour-parallel tool paths generated by means of proximity maps
inferred← citeshttps://doi.org/10.1016/0010-4485(95)00043-7openalex-snapshot
A tessellation algorithm for the representation of trimmed nurbs surfaces with arbitrary trimming curves
inferred← citeshttps://doi.org/10.1016/0010-4485(95)99797-copenalex-snapshot
Representing the Voronoi diagram of a simple polygon using rational quadratic Bézier curves
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90056-4openalex-snapshot
Fixed-radius near neighbors search algorithms for points and segments
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90104-6openalex-snapshot
Oracle complexities for computational geometry of semi-algebraic sets and Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90164-dopenalex-snapshot
Deferred data structure for the nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90020-lopenalex-snapshot
On maximum flows in polyhedral domains
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90019-2openalex-snapshot
An axiomatic approach to voronoi-diagrams in 3D
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90045-7openalex-snapshot
Computing some distance functions between polygons
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90064-copenalex-snapshot
Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90115-5openalex-snapshot
Voronoi diagrams over dynamic scenes
inferred← citeshttps://doi.org/10.1016/0167-8396(94)90029-9openalex-snapshot
The bisector of a point and a plane parametric curve
inferred← citeshttps://doi.org/10.1016/0167-8655(94)00087-jopenalex-snapshot
An efficient shape representation scheme using Voronoi skeletons
inferred← citeshttps://doi.org/10.1016/0278-6125(95)98872-4openalex-snapshot
Path planning with offset curves for layered fabrication processes
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00191-kopenalex-snapshot
An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00194-nopenalex-snapshot
On fast planning of suboptimal paths amidst polygonal obstacles in plane
inferred← citeshttps://doi.org/10.1016/0895-7177(96)00003-9openalex-snapshot
Voronoi-like partition of lattice in cellular automata
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90015-kopenalex-snapshot
A convex hull algorithm for discs, and applications
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90003-5openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00038-0openalex-snapshot
Characterization of contour elements that generate abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0925-7721(96)00002-8openalex-snapshot
Hunting Voronoi vertices
inferred← citeshttps://doi.org/10.1016/b978-0-444-81600-9.50022-5openalex-snapshot
Overview Of Allied Signal's XCUT System
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot
Computational Geometry
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-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
inferred← citeshttps://doi.org/10.1016/b978-044451104-1/50020-4openalex-snapshot
The Medial Axis Transform
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.amc.2020.125076openalex-snapshot
VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram
inferred← citeshttps://doi.org/10.1016/j.cad.2005.11.001openalex-snapshot
A sweepline algorithm for Euclidean Voronoi diagram of circles
inferred← citeshttps://doi.org/10.1016/j.cad.2008.08.004openalex-snapshot
Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
inferred← citeshttps://doi.org/10.1016/j.cad.2008.08.008openalex-snapshot
Medial axis computation for planar free–form shapes
inferred← citeshttps://doi.org/10.1016/j.cad.2011.03.001openalex-snapshot
Computation of the medial axis of planar domains based on saddle point programming
inferred← citeshttps://doi.org/10.1016/j.cad.2011.03.004openalex-snapshot
Robust beam compensation for laser-based additive manufacturing
inferred← citeshttps://doi.org/10.1016/j.cad.2022.103374openalex-snapshot
Robust Construction of Voronoi Diagrams of Spherical Balls in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1016/j.cagd.2004.03.005openalex-snapshot
Exploiting curvatures to compute the medial axis for domains with smooth boundary
inferred← citeshttps://doi.org/10.1016/j.cagd.2024.102388openalex-snapshot
Computing the cut locus, Voronoi diagram, and signed distance function of polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.03.007openalex-snapshot
Largest bounding box, smallest diameter, and related problems on imprecise points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.004openalex-snapshot
Divide-and-conquer for Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.10.003openalex-snapshot
Offset polygon and annulus placement problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.04.005openalex-snapshot
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.002openalex-snapshot
On soft predicates in subdivision motion planning
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.11.002openalex-snapshot
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102019openalex-snapshot
Multi-robot motion planning for unit discs with revolving areas
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.026openalex-snapshot
Empty pseudo-triangles in point sets
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.06.036openalex-snapshot
Low complexity algorithms for optimal consumer push-pull partial covering in the plane
inferred← citeshttps://doi.org/10.1016/j.ijggc.2021.103316openalex-snapshot
Passive acoustic localisation of undersea gas seeps using beamforming
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.07.008openalex-snapshot
Farthest line segment Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.rcim.2005.07.002openalex-snapshot
A new interpolation algorithm for tracing planar equidistant curves
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.008openalex-snapshot
Improved algorithms for the farthest colored Voronoi diagram of segments
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00071-7openalex-snapshot
Voronoi diagrams and offset curves of curvilinear polygons
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00073-0openalex-snapshot
Computing constrained minimum-width annuli of point sets
inferred← citeshttps://doi.org/10.1016/s0010-4485(98)00063-3openalex-snapshot
Polygon offsetting using a Voronoi diagram and two stacks
inferred← citeshttps://doi.org/10.1016/s0096-3003(01)00042-xopenalex-snapshot
The geometry of linear infeasibility
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)81666-9openalex-snapshot
Decomposing trimmed surfaces using the Voronoï diagram and a scan line algorithm
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00320-1openalex-snapshot
2-Point site Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00004-9openalex-snapshot
A transfinite form of Sibson's interpolant
inferred← citeshttps://doi.org/10.1016/s0167-8396(01)00050-4openalex-snapshot
Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
inferred← citeshttps://doi.org/10.1016/s0167-8396(01)00051-6openalex-snapshot
Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
inferred← citeshttps://doi.org/10.1016/s0167-8396(98)00007-7openalex-snapshot
Degenerate point/curve and curve/curve bisectors arising in medial axis computations for planar domains with curved boundaries
inferred← citeshttps://doi.org/10.1016/s0377-0427(98)00211-8openalex-snapshot
Voronoi diagram and medial axis algorithm for planar domains with curved boundaries I. Theoretical foundations
inferred← citeshttps://doi.org/10.1016/s0377-0427(98)00223-4openalex-snapshot
Voronoi diagram and medial axis algorithm for planar domains with curved boundaries — II: Detailed algorithm description
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)80001-xopenalex-snapshot
Locational optimization problems solved through Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00003-7openalex-snapshot
VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00016-8openalex-snapshot
On fat partitioning, fat covering and the union size of polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00006-6openalex-snapshot
Recognizing weakly convex visible polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00025-xopenalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00055-3openalex-snapshot
Queries with segments in Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1021/acsaenm.4c00389openalex-snapshot
A Facile Procedure for Simulating Grain Boundary Maps
inferred← citeshttps://doi.org/10.1023/a:1023753317008openalex-snapshot
Symmetry Maps of Free-Form Curve Segments via Wave Propagation
inferred← citeshttps://doi.org/10.1023/b:gein.0000034820.93914.d0openalex-snapshot
A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities
inferred← citeshttps://doi.org/10.1080/00038628.2024.2321584openalex-snapshot
D 4 G framework: a novel Voronoi diagram classification for decoding natural geometrics to enhance the built environment
inferred← citeshttps://doi.org/10.1080/00207169108803978openalex-snapshot
A straightforward algorithm for computing the medial axis of a simple polygon
inferred← citeshttps://doi.org/10.1080/02693799408901986openalex-snapshot
Nearest neighbourhood operations with generalized Voronoi diagrams: a review
inferred← citeshttps://doi.org/10.1080/07408170008967424openalex-snapshot
Cutter-path generation using multiple cutting-tool sizes for 2-1/2D pocket machining
inferred← citeshttps://doi.org/10.1080/09511920512331319645openalex-snapshot
Optimal tool selection for 2.5D milling, part 1: a solid-modeling approach for construction of the Voronoi mountain
inferred← citeshttps://doi.org/10.1080/13658816.2018.1434890openalex-snapshot
Voronoi tessellation on the ellipsoidal earth for vector data
inferred← citeshttps://doi.org/10.1080/16864360.2014.846092openalex-snapshot
C2 Approximation of Planar Curvilinear Profiles by Cubic B-Splines
inferred← citeshttps://doi.org/10.1080/16864360.2014.863508openalex-snapshot
Improved Spiral High-Speed Machining of Multiply-Connected Pockets
inferred← citeshttps://doi.org/10.1088/1742-6596/1651/1/012031openalex-snapshot
Decision Boundary Extraction of Classifiers
inferred← citeshttps://doi.org/10.1108/02644409910304086openalex-snapshot
Convex hull of a planar set of straight and circular line segments
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/21.384257openalex-snapshot
Robot navigation in unknown generalized polygonal terrains using vision sensors
inferred← citeshttps://doi.org/10.1109/34.574801openalex-snapshot
Shape representation using a generalized potential field model
inferred← citeshttps://doi.org/10.1109/70.127236openalex-snapshot
A potential field approach to path planning
inferred← citeshttps://doi.org/10.1109/70.97883openalex-snapshot
A 'retraction' method for learned navigation in unknown terrains for a circular robot
inferred← citeshttps://doi.org/10.1109/ccci49893.2020.9256520openalex-snapshot
Big Data Mining for Spatial-Temporal Characteristics of Catering Data
inferred← citeshttps://doi.org/10.1109/etfa.1996.573749openalex-snapshot
Planning safe motion for 2- and 3-DOF manipulators by computing an approximate medial axis of the free configuration space
inferred← citeshttps://doi.org/10.1109/geoinformatics.2011.5980668openalex-snapshot
Topology constrain for river dimension-reducing generalization in land-use map
inferred← citeshttps://doi.org/10.1109/icar.1997.620206openalex-snapshot
Random probing to approximate medial axes and plan safe motion
inferred← citeshttps://doi.org/10.1109/iccsa.2008.47openalex-snapshot
On the Structure of Straight Skeletons
inferred← citeshttps://doi.org/10.1109/iccv.1999.791243openalex-snapshot
Symmetry maps of free-form curve segments via wave propagation
inferred← citeshttps://doi.org/10.1109/icif.2006.301769openalex-snapshot
Identification of Simple Product-Form Plumes Using Networks of Sensors With Random Errors
inferred← citeshttps://doi.org/10.1109/icpr.1992.201990openalex-snapshot
Edge-region segmentation process based on generalized Voronoi diagram representation
inferred← citeshttps://doi.org/10.1109/icsmc.1991.169796openalex-snapshot
Robot navigation in unknown generalized polygonal terrains using a discrete scan sensor
inferred← citeshttps://doi.org/10.1109/ipps.1996.508057openalex-snapshot
A randomized algorithm for Voronoi diagram of line segments on coarse grained multiprocessors
inferred← citeshttps://doi.org/10.1109/isvd.2007.17openalex-snapshot
Direct Diffusion Method for the Construction of Generalized Voronoi Diagrams
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/isvd.2010.13openalex-snapshot
Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints
inferred← citeshttps://doi.org/10.1109/isvd.2011.9openalex-snapshot
Vroni and ArcVroni: Software for and Applications of Voronoi Diagrams in Science and Engineering
showing the first 200 of 276 · page through all 276
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.