Sciweavers

2877 search results - page 172 / 576
» The Complexity of Planarity Testing
Sort
View
ISER
2000
Springer
112views Robotics» more  ISER 2000»
15 years 8 months ago
Simulation and Experimental Evaluation of Complete Sensor-Based Coverage in Rectilinear Environments
: Although sensor-based coverage is a skill which is applicable to a variety of robot tasks, its implementation has so far been limited, mostly by the physical limitations of tradi...
Zack J. Butler, Alfred A. Rizzi, Ralph L. Hollis
129
Voted
CCCG
2010
15 years 6 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
WICON
2008
15 years 6 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
WSCG
2004
120views more  WSCG 2004»
15 years 5 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
COMGEO
2010
ACM
15 years 4 months ago
An efficient algorithm for the stratification and triangulation of an algebraic surface
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
Eric Berberich, Michael Kerber, Michael Sagraloff