Sciweavers

1009 search results - page 116 / 202
» On Indexing Line Segments
Sort
View
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
14 years 4 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
IWVF
2001
Springer
14 years 2 months ago
Judging Whether Multiple Silhouettes Can Come from the Same Object
We consider the problem of recognizing an object from its silhouette. We focus on the case in which the camera translates, and rotates about a known axis parallel to the image, suc...
David W. Jacobs, Peter N. Belhumeur, Ian Jermyn
KDD
1997
ACM
161views Data Mining» more  KDD 1997»
14 years 2 months ago
Automated Discovery of Active Motifs in Three Dimensional Molecules
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
Xiong Wang, Jason Tsong-Li Wang, Dennis Shasha, Br...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
GRAPHICSINTERFACE
2000
13 years 11 months ago
Dynamic Plane Shifting BSP Traversal
Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...
Stan Melax