Sciweavers

676 search results - page 33 / 136
» A Search-Free Intersection Algorithm
Sort
View
FOCS
1999
IEEE
14 years 2 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
14 years 2 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
CP
2010
Springer
13 years 8 months ago
Exponential Propagation for Set Variables
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
Justin Yip, Pascal Van Hentenryck
CGF
2011
13 years 1 months ago
Two-Level Grids for Ray Tracing on GPUs
We investigate the use of two-level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort-based construction algorithm an...
Javor Kalojanov, Markus Billeter, Philipp Slusalle...
IRI
2009
IEEE
14 years 4 months ago
Collaborative Schema Construction using Regular Sequence Types
In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over const...
Jorge Coelho, Mário Florido, Temur Kutsia