Sciweavers

676 search results - page 97 / 136
» A Search-Free Intersection Algorithm
Sort
View
119
Voted
CCCG
2007
15 years 3 months ago
Covering Points by Isothetic Unit Squares
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
PLANX
2008
15 years 3 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
106
Voted
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 3 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
WSCG
2004
160views more  WSCG 2004»
15 years 3 months ago
Real-Time Rendering of 3D Magic Lenses having arbitrary convex Shapes
We present a real-time algorithm for rendering volumetric 3D Magic LensesTM having arbitrary convex shapes. During fragment processing the algorithm performs a second depth test u...
Timo Ropinski, Klaus Hinrichs
IJCAI
1997
15 years 3 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...