Sciweavers

676 search results - page 43 / 136
» A Search-Free Intersection Algorithm
Sort
View
COMPGEOM
1995
ACM
14 years 1 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha
CCCG
2006
13 years 11 months ago
Polygon Reconstruction from Line Cross-Sections
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
Gill Barequet, Craig Gotsman, Avishay Sidlesky
JAPLL
2006
97views more  JAPLL 2006»
13 years 10 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
ICDE
2002
IEEE
126views Database» more  ICDE 2002»
14 years 11 months ago
Sequenced Subset Operators: Definition and Implementation
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
Joseph Dunn, Sean Davey, Anne Descour, Richard T. ...
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 10 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic