Sciweavers

92 search results - page 13 / 19
» Stabbers of line segments in the plane
Sort
View
COMPGEOM
2008
ACM
15 years 3 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
129
Voted
3DPVT
2006
IEEE
224views Visualization» more  3DPVT 2006»
15 years 7 months ago
3D Modeling Using Planar Segments and Mesh Elements
Range sensing technology allows the photorealistic modeling of large-scale scenes, such as urban structures. The generated 3D representations, after automated registration, are us...
Ioannis Stamos, Gene Yu, George Wolberg, Siavash Z...
ICCV
2009
IEEE
16 years 6 months ago
Piecewise Planar Stereo for Image-based Rendering
We present a novel multi-view stereo method designed for image-based rendering that generates piecewise planar depth maps from an unordered collection of photographs. First a di...
Sudipta N. Sinha, Drew Steedly and Richard Szelisk...
COCOON
2009
Springer
15 years 8 months ago
Convex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
15 years 8 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