𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A geometric constraint solver for 3-D assembly modeling

✍ Scribed by Xiaobo Peng; Kunwoo Lee; Liping Chen

Publisher
Springer
Year
2005
Tongue
English
Weight
431 KB
Volume
28
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A 2-D geometric constraint solver using
A 2-D geometric constraint solver using DOF-based graph reduction
✍ Jae Yeol Lee; Kwangsoo Kim πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 598 KB

In this paper, we propose a new DOF-based graph reduction approach to geometric constraint solving. In the proposed approach, we incrementally solve a geometric constraint problem that is not ruler-and-compass constructible by incrementally identifying a set of constrained geometric entities with 3

Multidimensional geometric modeling for
Multidimensional geometric modeling for 3D TCAD
✍ P. Regli; K. Lamboglia; G. GarretΓ³n; M. Neeracher; M. Westermann; N. Strecker; W πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 672 KB

This article gives an overview of our current state of the art in generating 3D geometry and doping representations for complex semiconductor devices. Focusing on the multidimensional aspects, we describe how -starting from the mask layout and the standard process representation (SPR)-the 3D device

A C-tree decomposition algorithm for 2D
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
✍ Xiao-Shan Gao; Qiang Lin; Gui-Fang Zhang πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 311 KB

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