On the public citation graph
A linear-time algorithm for computing the voronoi diagram of a convex polygon
0 signed · 272 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/3-540-08353-7_166openalex-snapshot
The medial axis of a simple polygon
inferredcites →https://doi.org/10.1007/bf02187695openalex-snapshot
Generalized delaunay triangulation for planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(79)90069-3openalex-snapshot
A linear algorithm for finding the convex hull of a simple polygon
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/41958.41981openalex-snapshot
Constrained Delaunay triangulations
inferredcites →https://doi.org/10.1145/41958.41982openalex-snapshot
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2811openalex-snapshot
Efficient Splitting and Merging Algorithms for Order Decomposable Problems
inferred← citeshttps://doi.org/10.1006/jagm.1996.0057openalex-snapshot
Enclosing a Set of Objects by Two Minimum Area Rectangles
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/jvci.2001.0503openalex-snapshot
On Computing General Position Views of Data in Three Dimensions
inferred← citeshttps://doi.org/10.1007/0-387-23639-2_2openalex-snapshot
(Generalized) Convexity and Discrete Optimization
inferred← citeshttps://doi.org/10.1007/11589440_7openalex-snapshot
Farthest-Point Queries with Geometric and Combinatorial Constraints
inferred← citeshttps://doi.org/10.1007/11600930_58openalex-snapshot
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/11682462_12openalex-snapshot
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/11821069_66openalex-snapshot
Constrained Minimum Enclosing Circle with Center on a Query Line Segment
inferred← citeshttps://doi.org/10.1007/11893318_17openalex-snapshot
A Voronoi Diagram Approach to Autonomous Clustering
inferred← citeshttps://doi.org/10.1007/3-540-36477-3_14openalex-snapshot
Java Applets for the Dynamic Visualization of Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_26openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_19openalex-snapshot
The construction of Delaunay diagrams by lob reduction
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-48447-7_8openalex-snapshot
Optimizing Constrained Offset and Scaled Polygonal Annuli
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_76openalex-snapshot
Finding the k smallest spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_93openalex-snapshot
Fast algorithms for greedy triangulation
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_66openalex-snapshot
Implicitly searching convolutions and computing depth of collision
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_163openalex-snapshot
Greedy triangulation approximates the optimum and can be implemented in linear time in the average case
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_283openalex-snapshot
An optimal algorithm for roundness determination on convex polygons
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_7openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
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-60220-8_51openalex-snapshot
Two-floodlight illumination of convex polygons
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_65openalex-snapshot
A linear-time construction of the relative neighborhood graph within a histogram
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_150openalex-snapshot
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_63openalex-snapshot
On removing non-degeneracy assumptions in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_215openalex-snapshot
Efficient splitting and merging algorithms for order decomposable problems
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_17openalex-snapshot
Two-Center Problems for a Convex Polygon (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_16openalex-snapshot
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-14085-4_20openalex-snapshot
Vector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital Pathology
inferred← citeshttps://doi.org/10.1007/978-3-319-95162-1_12openalex-snapshot
Highest Order Voronoi Processing on Apache Spark
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_8openalex-snapshot
Algorithms for Packing Two Circles in a Convex Polygon
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_27openalex-snapshot
Approximating TSP Solution by MST Based Graph Pyramid
inferred← citeshttps://doi.org/10.1007/978-3-540-73549-6_49openalex-snapshot
Voronoi Tessellation Based Rapid Coverage Decision Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77024-4_56openalex-snapshot
Analysis of Higher Order Voronoi Diagram for Fuzzy Information Coverage
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_10openalex-snapshot
Dilation-Optimal Edge Deletion in Polygonal Cycles
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_6openalex-snapshot
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_46openalex-snapshot
Resolving Loads with Positive Interior Stresses
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_7openalex-snapshot
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_22openalex-snapshot
On the Farthest Line-Segment Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_22openalex-snapshot
Vertex Deletion for 3D Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-60718-9_22openalex-snapshot
Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_33openalex-snapshot
Minimizing the Diameter of a Spanning Tree for Imprecise Points
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_35openalex-snapshot
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures
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/978-981-15-4470-5_7openalex-snapshot
Bumpy Pyramids Folded from Petal Polygons
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_6openalex-snapshot
An Optimal and Practical Algorithm for the Planar 2-Center Problem
inferred← citeshttps://doi.org/10.1007/bf01190153openalex-snapshot
Computing the intersection-depth of polyhedra
inferred← citeshttps://doi.org/10.1007/bf01228508openalex-snapshot
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
inferred← citeshttps://doi.org/10.1007/bf01989747openalex-snapshot
Efficiently updating constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01994879openalex-snapshot
Finding thek smallest spanning trees
inferred← citeshttps://doi.org/10.1007/bf02090398openalex-snapshot
Selection and sorting in totally monotone arrays
inferred← citeshttps://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.1007/bfb0015444openalex-snapshot
Finding the medial axis of a simple polygon in linear time
inferred← citeshttps://doi.org/10.1007/bfb0028249openalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1007/bfb0028250openalex-snapshot
On computing the voronoi diagram for restricted planar figures
inferred← citeshttps://doi.org/10.1007/pl00009194openalex-snapshot
Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source
inferred← citeshttps://doi.org/10.1007/pl00009216openalex-snapshot
A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons
inferred← citeshttps://doi.org/10.1007/pl00009392openalex-snapshot
Fitting a Set of Points by a Circle
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/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1007/s00224-001-1018-2openalex-snapshot
Computing the Optimal Bridge between Two Polygons
inferred← citeshttps://doi.org/10.1007/s00224-025-10228-9openalex-snapshot
An Optimal and Practical Algorithm for the Planar 2-center Problem
inferred← citeshttps://doi.org/10.1007/s00453-002-0939-8openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/s00453-013-9809-9openalex-snapshot
The k-Nearest-Neighbor Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1007/s00453-014-9950-0openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-017-0292-6openalex-snapshot
Minimizing the Diameter of a Spanning Tree for Imprecise Points
inferred← citeshttps://doi.org/10.1007/s00453-017-0375-4openalex-snapshot
Spanning Trees in Multipartite Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00453-017-0389-yopenalex-snapshot
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s00453-019-00651-zopenalex-snapshot
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00453-022-01027-6openalex-snapshot
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
inferred← citeshttps://doi.org/10.1007/s00453-022-01094-9openalex-snapshot
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles
inferred← citeshttps://doi.org/10.1007/s004530010078openalex-snapshot
Circular Separability of Polygons
inferred← citeshttps://doi.org/10.1007/s00454-003-2923-8openalex-snapshot
A Fully Dynamic Algorithm for Planar Width
inferred← citeshttps://doi.org/10.1007/s00454-006-1249-0openalex-snapshot
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
inferred← citeshttps://doi.org/10.1007/s00454-008-9052-3openalex-snapshot
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
inferred← citeshttps://doi.org/10.1007/s00454-010-9269-9openalex-snapshot
Conformal Mapping in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-011-9346-8openalex-snapshot
Computing Hereditary Convex Structures
inferred← citeshttps://doi.org/10.1007/s00454-022-00463-zopenalex-snapshot
Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s004540010062openalex-snapshot
Approximation Algorithms for Minimum-Width Annuli and Shells
inferred← citeshttps://doi.org/10.1007/s10596-009-9164-8openalex-snapshot
Analytical computation of arc menisci configuration under primary drainage in convex capillary cross sections
inferred← citeshttps://doi.org/10.1007/s10878-012-9532-5openalex-snapshot
An approximation algorithm for k-center problem on a convex polygon
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90030-lopenalex-snapshot
A simple algorithm for computing the smallest enclosing circle
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90227-mopenalex-snapshot
Computing the shortest diagonal of a monotone polygon in linear time
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90041-topenalex-snapshot
Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90108-oopenalex-snapshot
A relationship between Gale transforms and Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90124-uopenalex-snapshot
Applications of generalized matrix searching to geometric algorithms
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90115-5openalex-snapshot
Voronoi diagrams over dynamic scenes
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90142-zopenalex-snapshot
A note on Delaunay diagonal flips
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90022-qopenalex-snapshot
Finding k points with minimum diameter and related problems
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)90018-nopenalex-snapshot
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90025-nopenalex-snapshot
Fully dynamic delaunay triangulation in logarithmic expected time per operation
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90028-qopenalex-snapshot
Minimizing the sum of diameters efficiently
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00004-6openalex-snapshot
An optimal algorithm for roundness determination on convex polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50024-9openalex-snapshot
Convexity and Discrete Optimization
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/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferred← citeshttps://doi.org/10.1016/j.comcom.2015.07.022openalex-snapshot
Exploiting skeletonization to restore connectivity in a wireless sensor network
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.07.002openalex-snapshot
Farthest-point queries with geometric and combinatorial constraints
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.08.002openalex-snapshot
Weighted skeletons and fixed-share decomposition
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.12.007openalex-snapshot
Delaunay triangulation of imprecise points in linear time after preprocessing
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.01.002openalex-snapshot
Constrained minimum enclosing circle with center on a query line segment
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.002openalex-snapshot
Compressing spatio-temporal trajectories
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.03.002openalex-snapshot
Abstract Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.10.001openalex-snapshot
Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.07.003openalex-snapshot
Reachability by paths of bounded curvature in a convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.006openalex-snapshot
Weighted straight skeletons in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.01.004openalex-snapshot
Reprint of: Weighted straight skeletons in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.013openalex-snapshot
Forest-like abstract Voronoi diagrams in linear time
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.007openalex-snapshot
Assigning weights to minimize the covering radius in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101936openalex-snapshot
Covering convex polygons by two congruent disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102122openalex-snapshot
On the line-separable unit-disk coverage and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102269openalex-snapshot
Computing maximum cliques in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.compag.2013.08.014openalex-snapshot
Shape-describing indices for agricultural field plots and their relationship to operational efficiency
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.002openalex-snapshot
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.04.002openalex-snapshot
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.07.008openalex-snapshot
Farthest line segment Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.004openalex-snapshot
Optimizing a constrained convex polygonal annulus
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2023.115501openalex-snapshot
Study of a hull form optimization system based on a Gaussian process regression algorithm and an adaptive sampling strategy, Part II: Multi-objective optimization
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.318openalex-snapshot
Computational aspects of disks enclosing many points
inferred← citeshttps://doi.org/10.1016/j.rcim.2018.05.006openalex-snapshot
Path planning method for on-machine inspection of aerospace structures based on adjacent feature graph
inferred← citeshttps://doi.org/10.1016/j.sbspro.2013.08.229openalex-snapshot
Resident Mobility Analysis Based on Mobile-phone Billing Data
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114054openalex-snapshot
The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
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/s0020-0190(00)00143-5openalex-snapshot
On optimal bridges between two convex regions
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00228-3openalex-snapshot
On computing the optimal bridge between two convex polygons
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00154-4openalex-snapshot
Placing two disks in a convex polygon
inferred← citeshttps://doi.org/10.1016/s0141-6359(97)00044-5openalex-snapshot
Utilization of voronoi diagrams for circularity algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00024-2openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1016/s0898-1221(04)90129-0openalex-snapshot
Collision detection algorithm of a continuous type using spherical extreme vertex 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(01)00044-xopenalex-snapshot
Packing two disks in a polygon
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1049/iet-cta.2009.0298openalex-snapshot
Convex Voronoi-inspired space partitioning for heterogeneous networks: a coverage-oriented approach
inferred← citeshttps://doi.org/10.1061/(asce)gt.1943-5606.0002551openalex-snapshot
Estimating Unbiased Statistics for Fundamental Site Frequency Using Spatially Distributed HVSR Measurements and Voronoi Tessellation
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/10630732.2017.1386939openalex-snapshot
Cellpath Routing and Route Traffic Flow Estimation Based on Cellular Network Data
inferred← citeshttps://doi.org/10.1080/10867651.1996.10487455openalex-snapshot
Triangulating Convex Polygons Having T-Vertices
inferred← citeshttps://doi.org/10.1080/17538947.2024.2431100openalex-snapshot
An adaptive approach for generating Voronoi diagrams for residential areas containing adjacent polygons
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/access.2025.3562796openalex-snapshot
Modeling Parking Occupancy Using Algorithm of 3D Visibility Network
inferred← citeshttps://doi.org/10.1109/adhes.1998.742053openalex-snapshot
Incremental algorithms of finding offset distance and minimum passage width using Voronoi diagram technique [CAM machining]
inferred← citeshttps://doi.org/10.1109/cmc.2010.251openalex-snapshot
Minimum Sensor Relocation for k-Coverage in Wireless Sensor Networks
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/glocom.2014.7036821openalex-snapshot
Straight skeleton based reconnection in a wireless sensor network
inferred← citeshttps://doi.org/10.1109/hicss.1994.323268openalex-snapshot
Unstructured multigrid strategies on massively parallel computers: a case for integrated design
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622661openalex-snapshot
Uncoordinated Interference Avoidance between Terrestrial and Non-Terrestrial Communications
inferred← citeshttps://doi.org/10.1109/icmsao.2019.8880391openalex-snapshot
HVoR-Tree: Indexing Highest Order Voronoi Cells Using VoR-Tree
inferred← citeshttps://doi.org/10.1109/icoict.2017.8074684openalex-snapshot
Indexing Voronoi cells using quadtree in spatial database
inferred← citeshttps://doi.org/10.1109/icpr.1996.545991openalex-snapshot
Fast analytical medial-axis localization in convex polyhedra
inferred← citeshttps://doi.org/10.1109/isbi.2018.8363826openalex-snapshot
Morphological operations on polygons using straight skeletons for digital pathology
inferred← citeshttps://doi.org/10.1109/isvd.2011.9openalex-snapshot
Vroni and ArcVroni: Software for and Applications of Voronoi Diagrams in Science and Engineering
inferred← citeshttps://doi.org/10.1109/robot.1992.220116openalex-snapshot
Motion planning for spider robots
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63539openalex-snapshot
An optimal algorithm for intersecting three-dimensional convex polyhedra
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185368openalex-snapshot
Randomized multidimensional search trees: lazy balancing and dynamic shuffling
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959881openalex-snapshot
Approximate shape fitting via linearization
inferred← citeshttps://doi.org/10.1137/23m1545975openalex-snapshot
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
inferred← citeshttps://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1137/s0097539796305365openalex-snapshot
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
inferred← citeshttps://doi.org/10.1137/s0097539798349188openalex-snapshot
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
inferred← citeshttps://doi.org/10.1142/s0218195902000815openalex-snapshot
ON DELETION IN DELAUNAY TRIANGULATIONS
inferred← citeshttps://doi.org/10.1142/s0218195902000888openalex-snapshot
A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
inferred← citeshttps://doi.org/10.1142/s0218195910003207openalex-snapshot
DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES
inferred← citeshttps://doi.org/10.1142/s0218195911003858openalex-snapshot
AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195912500124openalex-snapshot
A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218195913600121openalex-snapshot
ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
inferred← citeshttps://doi.org/10.1142/s021819599200007xopenalex-snapshot
RANDOMIZATION YIELDS SIMPLE O(n log ⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218195998000187openalex-snapshot
Voronoi Diagrams of Moving Points
inferred← citeshttps://doi.org/10.1145/100216.100259openalex-snapshot
Output sensitive construction of levels and Voronoi diagrams in R d of order 1 to k
inferred← citeshttps://doi.org/10.1145/109648.109664openalex-snapshot
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
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/1185448.1185452openalex-snapshot
Finding optimal weighted bridges with applications
inferred← citeshttps://doi.org/10.1145/1377676.1377700openalex-snapshot
Self-improving algorithms for delaunay triangulations
inferred← citeshttps://doi.org/10.1145/1377676.1377727openalex-snapshot
Delaunay triangulations of imprecise pointsin linear time after preprocessing
inferred← citeshttps://doi.org/10.1145/142675.142725openalex-snapshot
Stable placements for spider robots
inferred← citeshttps://doi.org/10.1145/142675.142738openalex-snapshot
Manhattonian proximity in a simple polygon
inferred← citeshttps://doi.org/10.1145/1542362.1542374openalex-snapshot
Computing hereditary convex structures
inferred← citeshttps://doi.org/10.1145/160985.161008openalex-snapshot
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
showing the first 200 of 260 · page through all 260
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.