Concept
Géométrie discrète
Publications associées (65)
Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids
We consider the cocircuit graph GM of an oriented matroid M, which is the 1-skeleton of the cell complex formed by the span of the cocircuits of M. As a result of Cordovil, Fukuda, and Guedes de Oliveira, the isomorphism class of M is not determined by GM, ...
2001Digitization of Bezier curves and patches using discrete geometry
Existing algorithms for rendering Bezier curves and surfaces fall into two categories: iterative evaluation of the parametric equations (generally using forward differencing techniques) or recursive subdivision. In the latter case, all the algorithms rely ...
Springer-Verlag1999A configuration space approach for efficient animation of human figures
We propose an efficient method for animation of virtual human models in an environment of obstacles. A nearby target location reachable by a human figure is given and a search is performed in the object space encompassing obstacles to obtain an optimum con ...
1997New results about 3D digital lines
The current definition of 3D digital lines, which uses the 2D digital lines of closest integer points (Bresenham's lines) of two projections, has several drawbacks: the discrete topology of this 3D digital line notion is not clear; its third projection is, ...
SPIE-Int. Soc. Opt. Eng1996Asymptotics for geometric combinatorial optimization problems
We derive an asymptotic theorem generalizing in a sense the one by Beardwood et al. and Steele for the Traveling Salesman Problem, the minimun weight perfect matching problem and the minimum spanning tree problem on a random set of points in R^d, where the ...
1990