Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Berghe, W. V.
Right arrow Articles by Aerts, P.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Berghe, W. V.
Right arrow Articles by Aerts, P.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© IRL Press Limited

A hidden-line algorithm for graphical reconstruction of serially sectioned objects

W. Vanden Berghe 1 and P. Aerts *

Zoological Institute, State University Ghent Ledeganckstraat 35, B-9000 Ghent, Belgium

*To whom reprints requests should be sent at Laboratonum voor Morfologie en Systematiek der Dieren, Ledeganckstraat 35, B-9000 Ghent, Belgium

An algorithm for hidden-line removal in graphical reconstructions of serially sectioned biological objects is developed for PC-like computer configurations. The aim is to handle complicated structures defined by vast numbers of coordinate pairs and intersections between contours, without requiring excessive computing time. The procedure depends upon a fast searching routine for the localization of intersections and visibility.

Received on September 8, 1987; accepted on December 21, 1987

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.