1982
DOI: 10.2307/3213553
|View full text |Cite
|
Sign up to set email alerts
|

The basic structures of Voronoi and generalized Voronoi polygons

Abstract: For each particle in an aggregate of point particles in the plane, the set of points having it as closest particle is a convex polygon, and the aggregate V of such Voronoi polygons tessellates the plane. The geometric and stochastic structure of a random Voronoi polygon relative to a homogeneous Poisson process is specified.Similarly, those points of the plane possessing the same n nearest particles constitute a convex polygon cell in the generalized Voronoi tessellation 𝒱 (n = 2, 3, ·· ·). In fact, 𝒱 = 𝒱1,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

1988
1988
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 36 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…We have chosen Voronoi tessellations to explore the emergence of diverse organizations in packed tissues. It has been described that a random distribution of seeds in the Euclidean plane produces a Poisson–Voronoi diagram with a fixed polygon distribution that is independent of the number of starting seeds (Miles & Maillardet, ). We have reproduced these results (Fig F and G) and also obtained histograms enriched in hexagons (29.5%), pentagons (25.9%) and heptagons (19.9%), among other polygons (Fig E Diagram 1 and Table EV1).…”
Section: Resultsmentioning
confidence: 99%
“…We have chosen Voronoi tessellations to explore the emergence of diverse organizations in packed tissues. It has been described that a random distribution of seeds in the Euclidean plane produces a Poisson–Voronoi diagram with a fixed polygon distribution that is independent of the number of starting seeds (Miles & Maillardet, ). We have reproduced these results (Fig F and G) and also obtained histograms enriched in hexagons (29.5%), pentagons (25.9%) and heptagons (19.9%), among other polygons (Fig E Diagram 1 and Table EV1).…”
Section: Resultsmentioning
confidence: 99%
“…At a basic level, a Voronoi diagram partitions the space around a set of focal points, such that each point is contained in a single polygonal zone. The boundaries of each Voronoi polygon are defined such that all areas within a given focal point's polygon are closer to that focal point than to any other focal point (Aurenhammer, 1991;Miles & Maillardet, 1982;Okabe, Boots, Sugihara, & Chiu, 2000). Applied to the context of schools, a Voronoi diagram for each school district is constructed around all of the schools in the district that serve students of the same grade level.…”
Section: Voronoi Polygonal Attendance Zonesmentioning
confidence: 99%
“…A mathematically rigorous and self-contained presentation of the basic material (mean-value relationships, PVT's, stochastic-and integral-geometric tools) on random VT's can be found in Møller (1994). For further details and the historical background the reader is also referred to the monographs of Okabe et al (2000) and Stoyan et al (1995) (in particular Chapter 10 and references therein) and the papers by Miles (1970), Miles and Maillardet (1982), Møller (1989) and others. Because there are only a few explicit formulae of distributional characteristics of PVT's (see e.g.…”
Section: Basic Definitions and Preliminary Resultsmentioning
confidence: 99%