Sciweavers

656 search results - page 52 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
CAD
2007
Springer
13 years 7 months ago
Detection of closed sharp edges in point clouds using normal estimation and graph theory
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
Kris Demarsin, Denis Vanderstraeten, Tim Volodine,...
CSR
2007
Springer
14 years 1 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
WG
2005
Springer
14 years 1 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
ENTCS
2006
135views more  ENTCS 2006»
13 years 7 months ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme
STACS
1991
Springer
13 years 11 months ago
The RELVIEW-System
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
Rudolf Berghammer, Gunther Schmidt