Sciweavers

1245 search results - page 51 / 249
» Triangulation for Points on Lines
Sort
View
ICIP
2005
IEEE
15 years 11 months ago
Fast 2D model-to-image registration using vanishing points for sports video analysis
This article focuses on the field-to-image registration for TV sports-related image processing through basic geometrical reasoning. We propose a robust automatic line-based method...
Jean-Bernard Hayet, Justus H. Piater, Jacques G. V...
COMPGEOM
2004
ACM
15 years 3 months ago
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
János Pach, Rom Pinchasi, Micha Sharir
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
15 years 3 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
14 years 9 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
CCCG
2007
14 years 11 months ago
Capturing Crossings: Convex Hulls of Segment and Plane Intersections
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoey...