Results 261 to 270 of about 966,408 (295)

Geometric constraints solving

Proceedings of the 2006 ACM symposium on Solid and physical modeling, 2006
This paper presents some important issues and potential research tracks for Geometric Constraint Solving: the use of the simplicial Bernstein base to reduce the wrapping effect in interval methods, the computation of the dimension of the solution set with methods used to measure the dimension of fractals, the pitfalls of graph based decomposition ...
Dominique Michelucci, Sebti Foufou, Loïc Lamarque, Pascal Schreck   +3 more
openaire   +1 more source

Numerical decomposition of geometric constraints

Proceedings of the 2005 ACM symposium on Solid and physical modeling, 2005
Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of ...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurzak   +2 more
openaire   +1 more source

LGS: Geometric Constraint Solver

2004
In the paper we present LGS — a geometric constraint solver developed at LEDAS Ltd. We review different approaches in geometric constraint solving, present our one, describe in details LGS architecture and the ideas behind it. The main idea of LGS is to decompose the initial problem into a set of simpler ones, to map each instance to a class of ...
Alexey Ershov, Ilia Ivanov, Serge Preis, Eugene Rukoleev, Dmitry Ushakov   +4 more
openaire   +2 more sources

Numerical solving of geometric constraints

Proceedings Sixth International Conference on Information Visualisation, 2003
In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships, called constraints between geometric elements. The problem is to derive automatically these geometric elements. Many resolution methods have been proposed for solving systems of geometric constraints.
openaire   +2 more sources

Collinearity Constraints on Geometric Figures

1993
The preservation of collinearity relationships under geometric operations is important in computer-graphics applications that manipulate line arrangements in engineering drawings and geographic information systems. Finite-precision computer implementations of these operations do not generally preserve these relationships.
Maharaj Mukherjee, George Nagy
openaire   +2 more sources

On the derivation of geometric constraints in stereo

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003
Probability density functions (PDFs) are derived for many of the geometric measurements upon which stereo matching techniques are based, including orientation differences between matching line segments or curves, the gradient of disparity, the directional derivative of disparity, and disparity differences between matches.
openaire   +2 more sources

Geometrical Constraints on the Development of a Diatom

Journal of Theoretical Biology, 2001
In a plane hexagonal array of pores such as occurs in Thalassiosira oestrupii and other related species of marine diatom, the presence of a single, exceptional pore near the center of the array can cause the distortion in the pattern in such a way that the pores tend to diminish in diameter D with increasing distance R from the center.
openaire   +2 more sources

Decomposition of geometrical constraint systems with reparameterization

Proceedings of the 27th Annual ACM Symposium on Applied Computing, 2012
Decomposition of constraint systems is a key component of geometric constraint solving in CAD. On the other hand, some authors have introduced the notion of reparameterization which aims at helping the solving of indecomposable systems by replacing some geometric constraints by other ones.
Mathis, Pascal, Schreck, Pascal, Imbach, Rémi   +2 more
openaire   +3 more sources

Pose Estimation Using Geometric Constraints

2001
The paper concerns 2D-3D pose estimation in the algebraic language of kinematics. The pose estimation problem is modeled on the base of several geometric constraint equations. In that way the projective geometric aspect of the topic is implicitly represented and thus, pose estimation is a pure kinematic problem.
Gerald Sommer, Bodo Rosenhahn, Yiwen Zhang 0006   +2 more
openaire   +1 more source

Geometric Constraint Decomposition

1998
We present a flow-based method for decomposing the graph of a geometric constraint problem. The method fully generalizes degree-of-freedom calculations, prior approaches based on matching specific subgraph patterns, as well as prior flow-based approaches.
Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam   +2 more
openaire   +1 more source