Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets (Q4946708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1422764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets |
scientific article; zbMATH DE number 1422764 |
Statements
Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets (English)
0 references
10 October 2000
0 references
dynamic Voronoi diagrams
0 references
computational geometry
0 references
geometric fitting
0 references
Davenport-Schinzel sequences
0 references
cubic algorithm
0 references
0.7860875725746155
0 references
0.7808082103729248
0 references
0.7766505479812622
0 references
0.7758521437644958
0 references
A weight geometric fitting problem between two sets of points is to minimize the maximum weighted distance between two corresponding pairs of points by translating and rotating one set to the other set. The authors show a new reduction of the problem to the two-dimensional Davenport-Schinzel sequences, and provide a proof for an almost cubic algorithm that uses the dynamic weighted furthest Voronoi diagrams.
0 references
