Sciweavers

1245 search results - page 6 / 249
» Triangulation for Points on Lines
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
COMPGEOM
2011
ACM
14 years 1 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 2 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
EWC
2011
98views more  EWC 2011»
14 years 4 months ago
Real-time triangulation of point streams
Hand-held laser scanners are commonly used in industry for reverse engineering and quality measurements. In this process, it is difficult for the human operator to scan the target...
Klaus Denker, Burkhard Lehner, Georg Umlauf
ACSC
2010
IEEE
14 years 4 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche