Sciweavers

TCS
1998
13 years 11 months ago
A Partial k-Arboretum of Graphs with Bounded Treewidth
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
Hans L. Bodlaender
CAD
1999
Springer
13 years 11 months ago
Object reconstruction by incorporating geometric constraints in reverse engineering
Naoufel Werghi, Robert B. Fisher, Craig Robertson,...
CAD
1999
Springer
13 years 11 months ago
An introduction to line geometry with applications
Helmut Pottmann, Martin Peternell, Bahram Ravani
CAD
1999
Springer
13 years 11 months ago
Computing offsets of NURBS curves and surfaces
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
Les A. Piegl, Wayne Tiller
CAD
1999
Springer
13 years 11 months ago
Set-combinations of the mixed-dimension cellular objects of the Djinn API
This paper is concerned with the mathematics and formal specification of "set-like" operations for the mixed dimension cellular objects of the Djinn Application Programm...
Alan E. Middleditch, Chris Reade, Abel J. P. Gomes
CAD
1999
Springer
13 years 11 months ago
The intersection of two ruled surfaces
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
Hee-Seok Heo, Myung-Soo Kim, Gershon Elber
CAD
1999
Springer
13 years 11 months ago
Geometric constraint satisfaction using optimization methods
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
Jian-Xin Ge, Shang-Ching Chou, Xiao-Shan Gao