Sciweavers

895 search results - page 61 / 179
» Approximate convex decomposition
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
15 years 4 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
ICIP
2010
IEEE
14 years 7 months ago
Total subset variation prior
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
Sanjeev Kumar, Truong Q. Nguyen
ESOP
2007
Springer
15 years 4 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter
GMP
2000
IEEE
138views Solid Modeling» more  GMP 2000»
15 years 2 months ago
On Optimal Tolerancing in Computer-Aided Design
A geometric approach to the computation of precise or well approximated tolerance zones for CAD constructions is given. We continue a previous study of linear constructions and fr...
Helmut Pottmann, Boris Odehnal, Martin Peternell, ...