Sciweavers

4949 search results - page 4 / 990
» Consistency and Set Intersection
Sort
View
CAGD
2004
60views more  CAGD 2004»
13 years 10 months ago
Linear perturbation methods for topologically consistent representations of free-form surface intersections
By applying displacement maps to slightly perturb two free
Xiaowen Song, Thomas W. Sederberg, Jianmin Zheng, ...
DAM
2011
13 years 5 months ago
Minimum sum set coloring of trees and line graphs of trees
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Flavia Bonomo, Guillermo Durán, Javier Mare...
CAGD
2004
76views more  CAGD 2004»
13 years 10 months ago
Topologically consistent trimmed surface approximations based on triangular patches
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas...
ICDT
2003
ACM
202views Database» more  ICDT 2003»
14 years 3 months ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
TCS
2008
13 years 10 months ago
The supercover of an m-flat is a discrete analytical object
The aim of this paper is to show that the supercover of an m-flat (i.e. a Euclidean affine subspace of dimension m) in Euclidean n-space is a discrete analytical object. The super...
Eric Andres