Question

Largest empty circle/sphere with non-polygonal location constraints

score 311 · Answer 1 · 2026-04-23 20:00:11

311

Views

Largest empty circle/sphere with non-polygonal location constraints

Published on 23 Apr 2026 - 20:00

score 624 · Answer 2 · 2026-04-27 06:35:14

624

Views

Prove that for any n > 3 there is a set of n point sites in the plane such that one of the cells of Voronoi diagram(P) has n − 1 vertices

Published on 27 Apr 2026 - 6:35

score 207 · Answer 3 · 2026-03-07 17:09:11

207

Views

Bounds on the size of Voronoi cells

Published on 07 Mar 2026 - 17:09

score 174 · Answer 4 · 2026-05-10 23:48:13

174

Views

Voronoi edges example

Published on 10 May 2026 - 23:48

score 130 · Answer 5 · 2026-04-14 11:03:58

130

Views

Obtain the set of points from Voronoi diagram

Published on 14 Apr 2026 - 11:03

score 263 · Answer 6 · 2026-03-25 13:53:17

263

Views

Delaunay triangulation: Finding all triangles with empty circumcircle

Published on 25 Mar 2026 - 13:53

score 2.3k · Answer 7 · 2026-05-01 00:53:07

2.3k

Views

$\{0, 1\}^n$ notation

Published on 01 May 2026 - 0:53

score 773 · Answer 8 · 2026-03-25 13:55:43

773

Views

In Fortune's algorithm, how can I determine the arc of the beach line that intersects a given vertical line?

Published on 25 Mar 2026 - 13:55

score 842 · Answer 9 · 2026-03-25 13:57:09

842

Views

Given a Voronoi diagram created in $\mathcal{O}(n)$, is it possible to find the closest pair of points in $\mathcal{O}(n)$?

Published on 25 Mar 2026 - 13:57

score 250 · Answer 10 · 2026-04-13 14:50:39

250

Views

Voronoi tessellation with known cell areas and unknown seeds

Published on 13 Apr 2026 - 14:50

score 1k · Answer 11 · 2026-03-25 13:56:56

1k

Views

How can I merge 2 Delaunay triangulations / Voronoï diagrams?

Published on 25 Mar 2026 - 13:56

score 53 · Answer 12 · 2026-03-25 06:58:55

53

Views

Mean value for the number of neighbors of typical cell on a manifold

Published on 25 Mar 2026 - 6:58

score 45 · Answer 13 · 2026-04-12 07:48:31

45

Views

Understand Reynold theorem application on additively weighted Voronoi diagram

Published on 12 Apr 2026 - 7:48

score 122 · Answer 14 · 2026-03-25 13:55:16

122

Views

Voronoi diagrams for groups of points (instead for single points)

Published on 25 Mar 2026 - 13:55

score 37 · Answer 15 · 2026-03-25 14:00:29

37

Views

Shape Transformation Via Medial Axis Transform

Published on 25 Mar 2026 - 14:00

List Question

Largest empty circle/sphere with non-polygonal location constraints

Prove that for any n > 3 there is a set of n point sites in the plane such that one of the cells of Voronoi diagram(P) has n − 1 vertices

Bounds on the size of Voronoi cells

Voronoi edges example

Obtain the set of points from Voronoi diagram

Delaunay triangulation: Finding all triangles with empty circumcircle

$\{0, 1\}^n$ notation

In Fortune's algorithm, how can I determine the arc of the beach line that intersects a given vertical line?

Given a Voronoi diagram created in $\mathcal{O}(n)$, is it possible to find the closest pair of points in $\mathcal{O}(n)$?

Voronoi tessellation with known cell areas and unknown seeds

How can I merge 2 Delaunay triangulations / Voronoï diagrams?

Mean value for the number of neighbors of typical cell on a manifold

Understand Reynold theorem application on additively weighted Voronoi diagram

Voronoi diagrams for groups of points (instead for single points)

Shape Transformation Via Medial Axis Transform

Trending Questions

Popular # Hahtags

Popular Questions