Sciweavers

12 search results - page 3 / 3
» Base station placement on boundary of a convex polygon
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
14 years 10 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
CCCG
2003
14 years 11 months ago
On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
Jaeil Choi, Andrzej Szymczak