Finding constrained and weighted Voronoi diagrams in the plane (Q1388136): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for constructing the weighted Voronoi diagram in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constrained Delaunay triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3795219 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Voronoi diagrams with barriers and the shortest diagonal problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient computation of the geodesic Voronoi diagram of points in a simple polygon / rank | |||
Normal rank | |||
Revision as of 11:51, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding constrained and weighted Voronoi diagrams in the plane |
scientific article |
Statements
Finding constrained and weighted Voronoi diagrams in the plane (English)
0 references
8 June 1998
0 references
Voronoi diagram
0 references
weighted Voronoi diagram
0 references
constrained Voronoi diagram
0 references
