Sciweavers

137 search results - page 23 / 28
» On polygons excluding point sets
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
GLOBECOM
2006
IEEE
14 years 1 months 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...
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 1 months 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
SI3D
2003
ACM
14 years 18 days 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
FSTTCS
2006
Springer
13 years 11 months ago
Multi-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...