✦ LIBER ✦

A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

✍ Scribed by Xiao-Shan Gao; Qiang Lin; Gui-Fang Zhang

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 311 KB
Volume: 38
Category: Article
ISSN: 0010-4485
DOI: 10.1016/j.cad.2005.03.002

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently.

📜 SIMILAR VOLUMES

Solving partial constraint satisfaction

Solving partial constraint satisfaction problems with tree decomposition

✍ Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

An alternating digital tree (ADT) algori

An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems

✍ Javier Bonet; Jaime Peraire 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 951 KB

A Constraint-Satisfaction Approach for 3

A Constraint-Satisfaction Approach for 3-D Object Recognition by Integrating 2-D and 3-D Data

✍ Michael Boshra; Hong Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 415 KB

We present a framework for recognition of 3D objects by integrating 2D and 3D sensory data. The major thrust of this work is to efficiently utilize all relevant data, both 2D and 3D, in the early stages of recognition, in order to reduce the computational requirements of the recognition process. To

A Tree Matching Algorithm and VLSI Archi

A Tree Matching Algorithm and VLSI Architecture for Real-Time 2D Object Classification

✍ M. Schaffer; T. Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 77 KB

## A Tree Matching Algorithm and VLSI Architecture for Real-Time 2D Object Classification his paper presents a real-time classification algorithm for two-dimensional (2D) object contours using a tree model which is implemented in a modular very large scale integration (VLSI) Tar chitecture. The ha

A Fast and Robust Algorithm for 2D/3D Pa

A Fast and Robust Algorithm for 2D/3D Panorama Ultrasound Data

✍ Otmar Scherzer; Armin Schoisswohl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 873 KB

T his paper presents a fast and robust algorithm for generating compound panorama images from partially (spatially) overlapping data sets. This method results in optimizing a nonlinear functional. We propose a multiscale approach for the solution of the optimization problem that is based on a multir

A Crank–Nicholson-based unconditionally

A Crank–Nicholson-based unconditionally stable time-domain algorithm for 2D and 3D problems

✍ Xin Xie; George Pan; Stephen Hall 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

## Abstract It has been shown that both ADI‐FDTD and CN‐FDTD are unconditionally stable. While the ADI is a second‐order approximation, CN is only in the first order. However, analytical expressions reveal that the CN‐FDTD has much smaller truncation errors and is more accurate than the ADI‐FDTD. N