𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Geometric constraint satisfaction using optimization methods

✍ Scribed by Jian-Xin Ge; Shang-Ching Chou; Xiao-Shan Gao


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
337 KB
Volume
31
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis


The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton-Raphson method. It is fast, but has the instability problem: the method requires good initial values. To overcome this problem, recently the homotopy method has been proposed and experimented with. According to the report, the homotopy method generally works much better in terms of stability. In this paper we use the numerical optimization method to deal with the geometric constraint solving problem. The experimental results based on our implementation of the method show that this method is also much less sensitive to the initial value. Further, a distinctive advantage of the method is that under-and over-constrained problems can be handled naturally and efficiently. We also give many instructive examples to illustrate the above advantages. α­§ Published by Elsevier Science Ltd.


πŸ“œ SIMILAR VOLUMES


Using artificial neural networks for con
✍ IliΓ© Popescu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 471 KB

We address the problem of solving a constraint satisfaction problem (CSP) by treating a constraint logic program (CLP) as a network of constraints. We attempt to show that each computation in a CLP becomes a sequence of linear steps, since the check satisfiability of the system of constraints is app

Boolean constraint satisfaction: complex
✍ Peter Jonsson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 125 KB

A boolean constraint satisfaction problem consists of some ΓΏnite set of constraints (i.e., functions from 0=1-vectors to {0; 1}) and an instance of such a problem is a set of constraints applied to speciΓΏed subsets of n boolean variables. The goal is to ΓΏnd an assignment to the variables which satis

Image segmentation by relaxation using c
✍ Fatih Kurugollu; BΓΌlent Sankur; A. Emre HarmancΔ± πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 814 KB

The problem of image segmentation using constraint satisfaction neural networks (CSNN) has been considered. Several variations of the CSNN theme have been advanced to improve its performance or to explore new structures. These new segmentation algorithms are based on interplay of additional constrai