• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

• 한국CDE학회논문집
• /
• 제3권4호
• /
• pp.211-222
• /
• 1998

Parametric design is an important modeling paradigm in CAD/CAM applications, enabling efficient design modifications and variations. One of the major issues in parametric design is to develop a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this appear, we propose a new approach to geometric constraint solving that employs a graph-based method to solve the ruler-and-compass constructible configurations and a numerical method to solve the ruler-and-compass non-constructible configurations, in a way that combines the advantages of both methods. The geometric constraint solving process consists of two phases: 1) planning phase and 2) execution phase. In the planning phase, a sequence of construction steps is generated by clustering the constrained geometric entities and reducing the constraint graph in sequence. in the execution phase, each construction step is evaluated to determine the geometric entities, using both approaches. By combining the advantages of the graph-based constructive approach with the universality of the numerical approach, the proposed approach can maximize the efficiency, robustness, and extensibility of geometric constraint solver.

• 한국CDE학회논문집
• /
• 제5권4호
• /
• pp.301-311
• /
• 2000

For effective part modifications which is necessary in the design process frequently, variational geometric modeling with constraint management being used in a wide. Most variational geometric modeling methods, however, manage just the constraints about sketch elements used for generation of primitives. Thus, not only constraint propagation but also re-build of various modeling operations stored in the modeling history is necessary iota part geometry modifications. Especially, re-build of high-cost Boolean operations is apt to deteriorate overall modeling efficiency abruptly. Therefore, in this paper we proposed an algorithm that can handle all geometric entities of the part directly. For this purpose, we introduced eight type geometric constraints to the various geometric calculations about all geometric entities in sweepings and Boolean operations as well as the existing constraints of the sketch elements. The algorithm has a merit of rapid part geometric modifications through only constraint propagation without rebuild of modeling operations which are necessary in the existing variational geometric modeling method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.376-382
• /
• 1991

In the analysis of constrained holonomic systems, the Lagange multiplier method yields a system of second-order ordinary differential equations of motion and algebraic constraint equations. Conventional holonomic or nonholonomic constraints are defined as geometric constraints in this paper. Previous works concentrate on the geometric constraints. However, if the total energy of a dynamic system can be computed from the initial energy plus the time integral of the energy input rate due to external or internal forces, then the total energy can be artificially treated as a constraint. The violation of the total energy constraint due to numerical errors can be used as information to control these errors. It is a necessary condition for accurate simulation that both geometric and energy constraints be satisfied. When geometric constraint control is combined with energy constraint control, numerical simulation of a constrained dynamic system becomes more accurate. A new convenient and effective method to implement energy constraint control in numerical simulation is developed based on the geometric interpretation of the relation between constraints in the phase space. Several combinations of energy constraint control with either Baumgarte's Constraint Violation Stabilization Method (CVSM) are also addressed.

• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.78-88
• /
• 2001

In order to adopt feature-based parametric modeling, CAD/CAM applications must have a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this paper, we describe a graph constructive approach to solving geometric constraint problems. Usually, a graph constructive approach is efficient, however it has its limitation in scope; it cannot handle ruler-and-compass non-constructible configurations and under-constrained problems. To overcome these limitations. we propose an algorithm that isolates ruler-and-compass non-constructible configurations from ruler-and-compass constructible configurations and applies numerical calculation methods to solve them separately. This separation can maximize the efficiency and robustness of a geometric constraint solver. Moreover, the solver can handle under-constrained problems by classifying under-constrained subgraphs to simplified cases by applying classification rules. Then, it decides the calculating sequence of geometric entities in each classified case and calculates geometric entities by adding appropriate assumptions or constraints. By extending the clustering types and defining several rules, the proposed approach can overcome limitations of previous graph constructive approaches which makes it possible to develop an efficient and robust geometric constraint solver.

• 충청수학회지
• /
• 제29권1호
• /
• pp.29-35
• /
• 2016

In this paper, we consider a convex optimization problem with a convex integrable objective function and a geometric constraint set. We characterize the solution set of the problem when we know its one solution.

• 컴퓨터교육학회논문지
• /
• 제8권1호
• /
• pp.73-80
• /
• 2005

변형 가능한 물체들 간의 자연스럽고 그럴듯한 상호작용을 얻거나, 시뮬래이션을 사용자가 원하는 시작 조건으로 설정하기 위해서는 이를 제어할 수 있는 기하학적인 제한을 직관적으로 정의하거나 제어 할 수 있어야 한다. 또한 사용자가 시뮬레이터의 중대한 변경 없이 시뮬레이션을 다양한 환경의 시뮬레이션문제를 풀기위한 기반으로 사용할 수 있어야 한다. 본 논문에서 제안된 물리학 기반의 기하학적 제한 시뮬레이션 시스템은 변형 가능한 물체를 표현하기 위혜서 비선형적인 유한요소 해석 방법을 사용하였으며, 제약 조건을 지키기 위해서 물체의 노드에 기하학적인 제한을 설정함으로써 제한 힘이 생성된다. 또한 사용자가 기하학적인 제한을 설정하고 변경 할 수 있도록 해주며, 이러한 제약들은 지속적으로 시뮬레이션 시스템을 통제 할 수 있도록 제한 힘으로 변환된다. 따라서 시뮬레이터는 물체에 적용되는 선형적, 각도, 부동식 등의 기하학적 제한을 통제 할 수 있다. 본 연구의 실험적인 결과들은 전체 시뮬레이션 동안 기하학적 제한이 작은 오차 범위 내에서 잘 지켜지고, 변형 가능한 물체의 원하는 형태를 잘 보존하고 있음을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2044-2059
• /
• 2022

Recent works have shown that the geometric constraint can be harnessed to boost the performance of CNN-based camera localization. However, the existing strategies are limited to imposing image-level constraint between pose pairs, which is weak and coarse-gained. In this paper, we introduce a pixel-level epipolar geometry constraint to vanilla localization framework without the ground-truth 3D information. Dubbed EpiLoc, our method establishes the geometric relationship between pixels in different images by utilizing the epipolar geometry thus forcing the network to regress more accurate poses. We also propose a variant called EpiSingle to cope with non-sequential training images, which can construct the epipolar geometry constraint based on a single image in a self-supervised manner. Extensive experiments on the public indoor 7Scenes and outdoor RobotCar datasets show that the proposed pixel-level constraint is valuable, and helps our EpiLoc achieve state-of-the-art results in the end-to-end camera localization task.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.661-665
• /
• 1996

An inverse kinemetics problem of a reclaimer which digs and transports ironstones or coals in the raw yard is investigated. Because of the special features of the reclaimer of which scooping buckets are attached around the rotating drum at the end of boom, kinematic redundancy occurs in determining the joint varialbes For a given reclaiming point in space the forward kinematics yields 3 equations, however the number of involved variables in the equations are four. A plane equation approximating the surface near a reclaiming point is obtained by considering 8 adjacent points surrounding the reclaiming point. One extra equation to overcome redunduncyis further obtained from the condition that the normal vector at a reclaiming point is perpendicular to the plane. An approximate solution for a simplified problem is first discussed, Numerical solution for the oritinal nonlinear porblem with a constraint equation is also investigated. Finally a closed form solution which is not exact but sufficiently close enough is proposed by exploiting geometric constraint.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2393-2396
• /
• 2005

We present a method to detect on-road vehicle using geometric invariant of feature points on side planes of the vehicle. The vehicles are assumed into a set of planes and the invariant from motion information of features on the plane segments the plane from the theory that a geometric invariant value defined by five points on a plane is preserved under a projective transform. Harris corners as a salient image point are used to give motion information with the normalized correlation centered at these points. We define a probabilistic criterion to test the similarity of invariant values between sequential frames. Experimental results using images of real road scenes are presented.