Sciweavers

526 search results - page 3 / 106
» Representations of structural closure operators
Sort
View
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
13 years 11 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
CP
2007
Springer
13 years 9 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
RTA
2005
Springer
13 years 10 months ago
Proof-Producing Congruence Closure
Many applications of congruence closure nowadays require the ability of recovering, among the thousands of input equations, the small subset that caused the equivalence of a given ...
Robert Nieuwenhuis, Albert Oliveras
ESA
2003
Springer
117views Algorithms» more  ESA 2003»
13 years 10 months ago
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...
Miguel Granados, Peter Hachenberger, Susan Hert, L...
RSCTC
1998
Springer
129views Fuzzy Logic» more  RSCTC 1998»
13 years 9 months ago
On Generalizing Pawlak Approximation Operators
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
Y. Y. Yao