Results 1  10
of
297,395
Geometrical Constraints on the
, 2008
"... The cosmological constant problem is examined under the assumption that the extrinsic curvature of the spacetime contributes to the vacuum. A compensation mechanism based on a variable cosmological term is proposed. Under a suitable hypothesis on the behavior of the extrinsic curvature, we find tha ..."
Abstract
 Add to MetaCart
The cosmological constant problem is examined under the assumption that the extrinsic curvature of the spacetime contributes to the vacuum. A compensation mechanism based on a variable cosmological term is proposed. Under a suitable hypothesis on the behavior of the extrinsic curvature, we find that an initially large Λ(t) rolls down rapidly to zero during the early stages of the universe. Using perturbation analysis, it is shown that such vacuum behaves essentially as a spin2 field which is independent of the metric.
Geometric constraint solving
 Computing in Euclidean Geometry
, 1995
"... We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized. ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized.
A Geometric Constraint Solver
, 1995
"... We report on the development of a twodimensional geometric constraint solver. The solver is a major component of a new generation of CAD systems that we are developing based on a highlevel geometry representation. The solver uses a graphreduction directed algebraic approach, and achieves interact ..."
Abstract

Cited by 69 (10 self)
 Add to MetaCart
We report on the development of a twodimensional geometric constraint solver. The solver is a major component of a new generation of CAD systems that we are developing based on a highlevel geometry representation. The solver uses a graphreduction directed algebraic approach, and achieves
Basics on Geometric Constraint Solving
"... We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized. ..."
Abstract
 Add to MetaCart
We survey the current state of the art in geometric constraint solving. Both 2D and 3D constraint solving is considered, and different approaches are characterized.
Solving Geometric Constraint Systems
, 1990
"... Finding the configurations of a set of rigid bodies that satisfy a set of geometric constraints is a problem traditionally solved by reformulating the geometry and constraints as algebraic equations which are solved symbolically or numerically. But many such problems can be solved by reasoning symbo ..."
Abstract

Cited by 69 (1 self)
 Add to MetaCart
Finding the configurations of a set of rigid bodies that satisfy a set of geometric constraints is a problem traditionally solved by reformulating the geometry and constraints as algebraic equations which are solved symbolically or numerically. But many such problems can be solved by reasoning
Geometrical Constraint in Grasping
"... Abstract — Geometrical constraint in grasping, which is as known as caging, gives some advantages over conventional forcecontrolled grasping. For the difficulty of achievement of complete caging from the limitation of DOF of the hand, we propose partial caging, where the object is partly surrounded ..."
Abstract
 Add to MetaCart
Abstract — Geometrical constraint in grasping, which is as known as caging, gives some advantages over conventional forcecontrolled grasping. For the difficulty of achievement of complete caging from the limitation of DOF of the hand, we propose partial caging, where the object is partly
Qualitative Study of Geometric Constraints
, 1997
"... Modelling by geometric constraints is a promising method in the field of CAD/CAM. However, this process, closely related to computer programming, is also prone error. A geometric constraints based modeller should help the end user to find his mistakes , or, better, not to commit ones by watching ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Modelling by geometric constraints is a promising method in the field of CAD/CAM. However, this process, closely related to computer programming, is also prone error. A geometric constraints based modeller should help the end user to find his mistakes , or, better, not to commit ones by watching
Geometric Constraints for CAGD
 In Proceedings of the 3rd International Conference on Mathematical Methods for CAGD, Ulvic
, 1995
"... . To enrich the shape vocabulary of mechanical CAD systems, we develop techniques that allow defining freeform curves from geometric constraints. An important aspect of this aproach is the ability to obtain all possible instances of curve segments satisfying the constraints of a dimensioned sketch. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
. To enrich the shape vocabulary of mechanical CAD systems, we develop techniques that allow defining freeform curves from geometric constraints. An important aspect of this aproach is the ability to obtain all possible instances of curve segments satisfying the constraints of a dimensioned sketch
Interactive Geometric Constraint Satisfaction
, 1996
"... This paper presents a new incremental approach to geometric constraint satisfaction that is tailored to interactive applications. Our approach categorizes solutions into geometric primitives representing a range of solutions with uniform geometric characteristics. This scheme keeps intermediate solu ..."
Abstract
 Add to MetaCart
This paper presents a new incremental approach to geometric constraint satisfaction that is tailored to interactive applications. Our approach categorizes solutions into geometric primitives representing a range of solutions with uniform geometric characteristics. This scheme keeps intermediate
Geometric Constraint Decomposition
"... We present a flowbased method for decomposing the graph of a geometric constraint problem. The method fully generalizes degreeoffreedom calculations, prior approaches based on matching specific subgraph patterns, as well as prior flowbased approaches. Moreover, the method generically iterates to ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
We present a flowbased method for decomposing the graph of a geometric constraint problem. The method fully generalizes degreeoffreedom calculations, prior approaches based on matching specific subgraph patterns, as well as prior flowbased approaches. Moreover, the method generically iterates
Results 1  10
of
297,395