A geometric hidden-line processing algorithm

Rankin, John R.

doi:10.1016/0097-8493(87)90038-0

“…A technique is used in [16,1,8,21,26] of splitting a line into segments anytime it intersects with any projected polygon boundary to make the segment visibility homogeneous. In the next sections, we will describe the different stages for arbitrary sculptured surfaces.…”

Section: Lemma 23 Let C Be a Curve In The Scene If Cp Does Not Intementioning

confidence: 99%

“…Hidden line removal is one of the earliest computer graphics problems; yet new algorithms appear every year [16,1,8,21,4,15,17,18,20,22,23,24,26]. Usually they are developed for polygonal data, so sculptured surfaces must be preprocessed and approximated as large collections of polygons.…”

Section: Introductionmentioning

confidence: 99%

Hidden curve removal for free form surfaces

Elber

¹

,

Cohen

²

1990

Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques

View full text Add to dashboard Cite

This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms, as most of the output set has an exact representation. Surface coherence is used to speed up the process. Although designed for sculptured surfaces, this algorithm is also suitable for polygonal data.

show abstract

“…Hidden line removal is one of the earliest computer graphics problems; yet new algorithms appear every year [16,1,8,21,4,15,17,18,20,22,23,24,26]. Usually they are developed for polygonal data, so sculptured surfaces must be preprocessed and approximated as large collections of polygons.…”

Section: Introductionmentioning

confidence: 99%

“…In [16,1,8,21,26] the idea of quantitative invisibility and the use of critical points was developed. Critical points are intersection points between projected polygon primitives.…”

Section: Introductionmentioning

confidence: 99%

Hidden curve removal for free form surfaces

ElberGershon

¹

,

CohenElaine

²

1990

SIGGRAPH Comput. Graph.

View full text Add to dashboard Cite

This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms, as most of the output set has an exact representation. Surface coherence is used to speed up the process. Although designed for sculptured surfaces, this algorithm is also suitable for polygonal data.

show abstract

“…He gives general guidelines for parallelizing the algorithm but no specific details are given. Rankin describes a hidden line removal algorithm which can be parallelized [21]. However, *Email: wrf@ecse.rpi.edu, Phone: (518) Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery.…”

Section: Introductionmentioning

confidence: 99%

Parallel object-space hidden surface removal

Franklin

¹

,

Kankanhalli

²

1990

Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques

View full text Add to dashboard Cite

A parallel object-space hidden surface removal algorithm for polyhedral scenes is presented. The uniform grid technique is used to achieve parallelism for the hidden line removal. A conflict-detection and back-off strategy is then used to obtain parallelism for the visible region reconstruction from the visible segments. The algorithm has been implemented on a Sequent Balance 21000 shared-memory parallel computer. An average speedup of 10 has been obtained using 15 processors.

show abstract

A geometric hidden-line processing algorithm

Cited by 8 publications

References 4 publications

Hidden curve removal for free form surfaces

Hidden curve removal for free form surfaces

Hidden curve removal for free form surfaces

Parallel object-space hidden surface removal

Contact Info

Product

Resources

About