In this paper we present an efficient algorithm for the off-line dynamic maintenance of the width of a planar point set in the following restricted case: We are given a real parameter W and a sequence X = (a,, , a,,) of n insert and delete operations on a set S of points in R2, initially consisting
β¦ LIBER β¦
Dynamic Maintenance of Maxima of 2-d Point Sets
β Scribed by Kapoor, Sanjiv
- Book ID
- 118177569
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2000
- Tongue
- English
- Weight
- 193 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0097-5397
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Off-line dynamic maintenance of the widt
β
Pankaj K. Agarwal; Micha Sharir
π
Article
π
1991
π
Elsevier Science
π
English
β 967 KB
Dynamical sets of points
β
Thomas Ottmann; Derick Wood
π
Article
π
1984
π
Elsevier Science
β 89 KB
Stability of maxima over randomly delete
β
Mark D. Rothmann
π
Article
π
1997
π
Elsevier Science
π
English
β 353 KB
The set of dynamically special points
β
B. Sankara Rao; I. Subramania Pillai; V. Kannan
π
Article
π
2011
π
Springer
π
English
β 144 KB
Regular triangulations of dynamic sets o
β
Marc Vigo; NΓΊria Pla; Josep Cotrina
π
Article
π
2002
π
Elsevier Science
π
English
β 596 KB
The Delaunay triangulations of a set of points are a class of triangulations which play an important role in a variety of different disciplines of science. Regular triangulations are a generalization of Delaunay triangulations that maintain both their relationship with convex hulls and with Voronoi
Scaling iterative closest point algorith
β
Shaoyi Du; Nanning Zheng; Lei Xiong; Shihui Ying; Jianru Xue
π
Article
π
2010
π
Elsevier Science
π
English
β 946 KB