Sciweavers

92 search results - page 11 / 19
» Stabbers of line segments in the plane
Sort
View
JCDCG
2004
Springer
15 years 7 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...
122
Voted
GD
2006
Springer
15 years 5 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
124
Voted
COMGEO
2000
ACM
15 years 1 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
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
15 years 10 days ago
Computing push plans for disk-shaped robots
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
Mark de Berg, Dirk H. P. Gerrits
CVPR
2004
IEEE
16 years 3 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