Sciweavers

CCCG
2003
13 years 5 months ago
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
Ali Asghar Khanban, Abbas Edalat
COMPGEOM
2001
ACM
13 years 8 months ago
A fully dynamic algorithm for planar
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
Timothy M. Chan
AUIC
2006
IEEE
13 years 10 months ago
A markerless registration method for augmented reality based on affine properties
This paper presents a markerless registration approach for Augmented Reality (AR) systems based on the Kanade-Lucas-Tomasi (KLT) natural feature tracker and the affine reconstruct...
Y. Pang, M. L. Yuan, Andrew Y. C. Nee, Soh-Khim On...