Computer Graphics 1987 1987
DOI: 10.1007/978-4-431-68057-4_23
|View full text |Cite
|
Sign up to set email alerts
|

Reconstruction and Semi-Transparent Display Method for Observing Inner Structure of an Object Consisting of Multiple Surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

1987
1987
1996
1996

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…This algorithm is still based on local constraints only and it cannot avoid defective triangles completely. To remedy this, Kaneda et al (1987) added another condition to Christiansen's method: for each triangle edge, the shortest of the possible candidates is selected. It cannot, however, always be satisfied.…”
Section: Heuristic Approach To Finding the Optimal Pathmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm is still based on local constraints only and it cannot avoid defective triangles completely. To remedy this, Kaneda et al (1987) added another condition to Christiansen's method: for each triangle edge, the shortest of the possible candidates is selected. It cannot, however, always be satisfied.…”
Section: Heuristic Approach To Finding the Optimal Pathmentioning
confidence: 99%
“…Their method was based on local constraints only. Kaneda et al (1987) proposed the addition of another condition to the shortest diagonal algorithm to remedy this problem. Because this condition cannot always be satisfied, the algorithm is still greedy.…”
Section: Introductionmentioning
confidence: 99%
“…The idea of using a topological object description to direct the process of reconstructing 3D surfaces from a stack of sections is not new. For instance, Kaneda et al (1987) described a hierarchical data structure, which can be used for this purpose. Each object is divided into sub-objects containing a succession of contours.…”
Section: Introductionmentioning
confidence: 99%
“…A major advantage of our data structure is that objects do not have to be divided manually into sub-objects. The main application of the hierarchical data structure suggested by Kaneda et al (1987) was to reconstruct 3D surfaces automatically independent of shape complexity, i.e., branching and objects contained within objects. The topological descriptions were used to avoid ambiguities and the surfaces were created by triangulation, based on the method suggested by Christiansen and Sederberg (1978).…”
Section: Introductionmentioning
confidence: 99%