Sciweavers

62 search results - page 8 / 13
» Triangulations of Line Segment Sets in the Plane
Sort
View
COMGEO
2000
ACM
13 years 8 months ago
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
ICCV
2009
IEEE
15 years 1 months ago
Moving in Stereo: Efficient Structure and Motion Using Lines
We present a fast and robust system for estimating structure and motion using a stereo pair, with straight lines as features. Our first set of contributions are efficient algorit...
Manmohan Chandraker, Jongwoo Lim, David Kriegman
JCDCG
2004
Springer
14 years 2 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...
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
14 years 2 months ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur
CVPR
2004
IEEE
14 years 10 months ago
The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...
René Vidal, Richard I. Hartley