Results 1  10
of
690
Progressive Simplicial Complexes
, 1997
"... In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier progressive mesh (PM) representation, it captures a given model as a coarse base model together with a sequence of refinement ..."
Abstract

Cited by 169 (2 self)
 Add to MetaCart
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier progressive mesh (PM) representation, it captures a given model as a coarse base model together with a sequence
Revising Hull and Box Consistency
 INT. CONF. ON LOGIC PROGRAMMING
, 1999
"... Most intervalbased solvers in the constraint logic programming framework are based on either hull consistency or box consistency (or a variation of these ones) to narrow domains of variables involved in continuous constraint systems. This paper rst presents HC4, an algorithm to enforce hull consist ..."
Abstract

Cited by 107 (14 self)
 Add to MetaCart
Most intervalbased solvers in the constraint logic programming framework are based on either hull consistency or box consistency (or a variation of these ones) to narrow domains of variables involved in continuous constraint systems. This paper rst presents HC4, an algorithm to enforce hull
Modeling with Cubic APatches
, 1995
"... We present a sufficient criterion for the Bernstein Bezier (BB) form of a trivariate polynomial within a tetrahedron, such that the real zero contour of the polynomial defines a smoothand singlesheeted algebraic surface patch, We call this an Apatch. We present algorithms to build a mesh of cubic ..."
Abstract

Cited by 68 (37 self)
 Add to MetaCart
Apatches to interpolate a given set of scattered point data in three dimensions, respecting tbe topology of any surface triangulation T of the given point set. In these algorithms we first specify “normals” an the data points, then build a simplicial hull consisting of tetrahedral surrounding
Hull consistency under monotonicity
 In Constraint Programming CP’09
"... Abstract. We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. This result holds including when variables have multiple occurrences in the expressions of the fun ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. This result holds including when variables have multiple occurrences in the expressions
An interpretation of consistent belief functions in terms of simplicial complexes
"... 655, avenue de l’Europe ..."
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
 Transportation Science
, 1991
"... The class of simplicial decomposition (SD) schemes have shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, maste ..."
Abstract

Cited by 53 (20 self)
 Add to MetaCart
, master problems are solved over the convex hull of the generated extreme points. We review the development of simplicial decomposition and the closely related column generation methods for the traffic assignment problem; we then present a modified, disaggregated, representation of feasible solutions
THE COLOURFUL SIMPLICIAL DEPTH CONJECTURE
"... Abstract. Given d+1 sets of points, or colours, S1,...,Sd+1 in Rd, a colourful simplex is a set T ⊆ ⋃d+1i=1 Si such that T ∩Si  ≤ 1, for all i ∈ {1,..., d+1}. The colourful Carathéodory theorem states that, if 0 is in the convex hull of each Si, then there exists a colourful simplex T containing ..."
Abstract
 Add to MetaCart
T containing 0 in its convex hull. Deza, Huang, Stephen, and Terlaky (Colourful simplicial depth, Discrete Comput. Geom., 35, 597–604 (2006)) conjectured that, when Si  = d + 1 for all i ∈ {1,..., d+ 1}, there are always at least d2 + 1 colourful simplices containing 0 in their convex hulls. We prove
Consistent CellDecomposition of Homeomorphic Simplicial Surfaces
, 2006
"... Surface representations of 3Dobjects play a central role in many branches of computer science, e.g., in computer graphics, digital geometry processing, visualisation and also in many numerical applications. Apart from the acquisition of models, typical tasks in these areas include the modification ..."
Abstract
 Add to MetaCart
Surface representations of 3Dobjects play a central role in many branches of computer science, e.g., in computer graphics, digital geometry processing, visualisation and also in many numerical applications. Apart from the acquisition of models, typical tasks in these areas include the modification and alteration of
Free Form Surface Design with APatches
 In Proceedings of Graphics Interface '94
, 1994
"... We present a sufficient criterion for the BernsteinBezier (BB)form of a trivariate polynomialwithina tetrahedron, such that the real zero contour of the polynomial defines a smooth and single sheeted algebraic surface patch. We call this an Apatch. We present algorithms to build a mesh of cubic A ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
patches to interpolate a given set of scattered point data in three dimensions, respecting the topologyof any surface triangulation T of the given point set. In these algorithms we first specify "normals" on the data points, then build a simplicial hull consisting of tetrahedra surrounding the surface
Decompositions of Simplicial Balls and Spheres With Knots Consisting of Few Edges
, 1999
"... Constructibility is a condition on pure simplicial complexes that is weaker than shellability. In this paper we show that nonconstructible triangulations of the ddimensional sphere exist for every d 3. This answers a question of Danaraj & Klee [8]; it also strengthens a result of Lickorish [1 ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
Constructibility is a condition on pure simplicial complexes that is weaker than shellability. In this paper we show that nonconstructible triangulations of the ddimensional sphere exist for every d 3. This answers a question of Danaraj & Klee [8]; it also strengthens a result of Lickorish
Results 1  10
of
690