876 search results - page 80 / 176 » Complexity in geometric SINR |
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
— Free-space dilation is an effective approach for narrow passage sampling, a well-recognized difficulty in probabilistic roadmap (PRM) planning. Key to this approach are method...
SI3D
2006
ACM
14 years 4 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
GRID
2005
Springer
14 years 3 months ago
2005
Springer
— In a grid-computing environment, resource selection and scheduling depend on the network topology connecting the computation nodes. This paper presents a method to hierarchical...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
CA
2003
IEEE
14 years 3 months ago
2003
IEEE
Mapping of features such as texture and geometric detail is an important tool that enhances realism of surface geometry in graphics and animation. This essentially involves a tran...