Sciweavers

44 search results - page 7 / 9
» On the number of rectangulations of a planar point set
Sort
View
ICCV
2001
IEEE
14 years 9 months ago
Plane-based Projective Reconstruction
A linear method for computing a projective reconstruction from a large number of images is presented and then evaluated. The method uses planar homographies between views to linea...
Robert Kaucic, Richard I. Hartley, Nicolas Y. Dano
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 7 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
CCCG
2010
13 years 9 months ago
I/O-efficient triangular range search and its application
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
Gautam K. Das, Bradford G. Nickerson
VCBM
2010
13 years 2 months ago
Fast and Smooth Interactive Segmentation of Medical Images Using Variational Interpolation
We present a fast and interactive segmentation method for medical images that allows a smooth reconstruction of an object's surface from a set of user drawn, three-dimensiona...
Frank Heckel, Olaf Konrad, Heinz-Otto Peitgen
ICDCS
2008
IEEE
14 years 1 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao