Sciweavers

94 search results - page 17 / 19
» Minimum-Perimeter Intersecting Polygons
Sort
View
CCCG
1993
13 years 8 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CG
2008
Springer
13 years 6 months ago
Barycentric coordinates computation in homogeneous coordinates
Homogeneous coordinates are often used in computer graphics and computer vision applications especially for the representation of geometric transformations. The homogeneous coordi...
Václav Skala
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 22 days ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
GLOBECOM
2006
IEEE
14 years 19 days ago
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in Wireless Sensor Networks
— Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on the geometry information of sensors and under the assumpt...
Azzedine Boukerche, Xin Fei, Regina Borges de Arau...
SI3D
2003
ACM
13 years 12 months ago
Shear-image order ray casting volume rendering
This paper describes shear-image order ray casting, a new method for volume rendering. This method renders sampled data in three dimensions with image quality equivalent to the be...
Yin Wu, Vishal Bhatia, Hugh C. Lauer, Larry Seiler