Pages that link to "Item:Q911267"
From MaRDI portal
The following pages link to A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267):
Displaying 48 items.
- A linear-time construction of Reuleaux polygons (Q2365262) (← links)
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Weighted skeletons and fixed-share decomposition (Q2483555) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- Cohesive zone representation and junction partitioning for crystal plasticity analyses (Q2952127) (← links)
- THE DELAUNAY HIERARCHY (Q3021945) (← links)
- Resolving Loads with Positive Interior Stresses (Q3183482) (← links)
- Star-Unfolding Polygons (Q3452273) (← links)
- A linear algorithm for determining the separation of convex polyhedra (Q3697818) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- Recognizing Voronoi Diagrams with Linear Programming (Q4024309) (← links)
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (Q4210159) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)
- Voronoi Diagrams of Moving Points (Q4513216) (← links)
- IMMOBILIZING A SHAPE (Q4513240) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
- AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) (← links)
- (Q4698691) (← links)
- ON DELETION IN DELAUNAY TRIANGULATIONS (Q4818555) (← links)
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING (Q4818561) (← links)
- An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
- Fast algorithms for greedy triangulation (Q5056107) (← links)
- Voronoi diagrams of moving points in higher dimensional spaces (Q5056158) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
- Two-floodlight illumination of convex polygons (Q5057422) (← links)
- A linear-time construction of the relative neighborhood graph within a histogram (Q5057436) (← links)
- An optimal algorithm for roundness determination on convex polygons (Q5060152) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- Vector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital Pathology (Q5237066) (← links)
- A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS (Q5300006) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
- Conformal mapping in linear time (Q5962354) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
- (Q6065430) (← links)
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time (Q6102307) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem (Q6202754) (← links)
- Finding the medial axis of a simple polygon in linear time (Q6487986) (← links)
- On the line-separable unit-disk coverage and related problems (Q6600812) (← links)
- An optimal and practical algorithm for the planar 2-center problem (Q6636068) (← links)
