Sciweavers

1245 search results - page 47 / 249
» Triangulation for Points on Lines
Sort
View
IVC
2002
102views more  IVC 2002»
14 years 9 months ago
A new approach to vanishing point detection in architectural environments
A man-made environment is characterized by many parallel lines and orthogonal edges. In this article, a new method for detecting the three mutually orthogonal directions of such a...
Carsten Rother
ICCV
2011
IEEE
13 years 9 months ago
Optimal Estimation of Vanishing Points in a Manhattan World
In this paper, we present an analytical method for computing the globally optimal estimates of orthogonal vanishing points in a “Manhattan world” with a calibrated camera. We ...
Faraz Mirzaei, Stergios Roumeliotis
JCDCG
2004
Springer
15 years 3 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
DMIN
2006
120views Data Mining» more  DMIN 2006»
14 years 11 months ago
Time Series as a Point - A Novel Approach for Time Series Cluster Visualization
: Temporal data mining is concerned with the analysis of temporal data and finding temporal patterns, regularities, trends, clusters in sets of temporal data. Wavelet transform pro...
R. Pradeep Kumar, P. Nagabhushan
JUCS
2007
148views more  JUCS 2007»
14 years 9 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth