Hidden line removal

Solid objects are usually modeled by polyhedra in a computer representation. A face of a polyhedron is a planar polygon bounded by straight line segments, called edges. Curved surfaces are usually approximated by a polygon mesh. Computer programs for line drawings of opaque objects must be able to decide which edges or which parts of the edges are hidden by an object itself or by other objects. This problem is known as hidden line removal.

The first known solution to the hidden-line problem was devised by Roberts[1] in 1963. However, it severely restricts the model: it requires that all objects be convex. In 1966 Ivan E. Sutherland [2] listed 10 unsolved problems in computer graphics. Problem number seven was "Hidden line removal". In terms of computational complexity, this problem was solved by Devai [3] in 1986.

Models, e.g., in computer-aided design, can have thousands or millions of edges. Therefore a computational-complexity approach, expressing resource requirements, such as time and memory, as the function of problem sizes, is crucial. Time requirements are particularly important in interactive systems.

Problem sizes for hidden line removal are the total number n of the edges of the model and the total number v of the visible segments of the edges. Visibility can change at the intersection points of the images of the edges. Let k denote the total number of the intersection points of the images of the edges. Both k = Θ(n2) and v = Θ(n2) in the worst case[3] but usually v < k.

Algorithms

Hidden-line algorithms published before 1984 [4] [5] [6] [7] divide edges into line segments by the intersection points of their images, and then test each segment for visibility against each face of the model. Assuming a model of a collection of polyhedra with the boundary of each topologically equivalent to a sphere and with faces topologically equivalent to disks, according to Euler's formula, there are Θ(n) faces. Testing Θ(n2) line segments against Θ(n) faces takes Θ(n3) time in the worst case.[3] Appel's algorithm[4] is also unstable, because an error in visibility will be propagated to subsequent segment endpoints.[8]

Ottmann and Widmayer [9] and Ottmann, Widmayer and Wood [10] proposed O((n + k)log2 n) time hidden-line algorithms. Then Nurmi [11] improved the running time to O((n + k)log n). These algorithms take Θ(n2log2 n), respectively Θ(n2log n) time in the worst case, but if k is less than quadratic, can be faster in practice.

Any hidden-line algorithm has to determine the union of Θ(n) hidden intervals on n edges in the worst case. As Ω(nlog n) is a lower bound for determining the union of n intervals [12] it appears that the best one can hope to achieve is Θ(n2log n) worst-case time and hence Nurmi's algorithm is optimal.

However, the log n factor was eliminated by Devai,[3] who raised the open problem if the same, optimal O(n2) upper bound existed for hidden surface removal. This problem was solved by McKenna [13] in 1987.

The intersection-sensitive algorithms [9][10][11] are mainly known in the computational-geometry literature. The quadratic upper bounds are also appreciated by the computer-graphics literature: Ghali [14] notes that the algorithms by Devai and McKenna "represent milestones in visibility algorithms" breaking a theoretical barrier from O(n2log n) to O(n2) for processing a scene of n edges.

The other open problem raised by Devai [3] that whether there exists an O(n log n + v)-time hidden-line algorithm, where v, as noted above, is the number of visible segments, is still unsolved at the time of writing.

Parallel algorithms

In 1988 Devai[15] proposed an O(log n)-time parallel algorithm using n2 processors for the hidden-line problem under the concurrent read, exclusive write (CREW) parallel random-access machine (PRAM) model of computation. As the product of the processor number and the running time is asymptotically greater than Θ(n2), the sequential complexity of the problem, the algorithm is not work-optimal, but it demonstrates that the hidden-line problem is in the complexity class NC, i.e., it can be solved in polylogarithmic time by using a polynomial number of processors.

Hidden-surface algorithms can be used for hidden line removal, but not the other way around. Reif and Sen [16] proposed an O(log4 n)-time algorithm for the hidden-surface problem, using O((n + v)/log n) CREW PRAM processors for a restricted model of polyhedral terrains, where v is the output size.

In 2011 Devai [17] published an O(log n)-time hidden-surface, and a simpler, also O(log n)-time, hidden-line algorithm. The hidden-surface algorithm, using n2/log n CREW PRAM processors, is work-optimal.

The hidden-line algorithm uses n2 exclusive read, exclusive write (EREW) PRAM processors. The EREW model is the PRAM variant closest to real machines. The hidden-line algorithm does O(n2log n) work, which is the upper bound for the best sequential algorithms used in practice.

Cook, Dwork and Reischuk [18] gave an Ω(log n) lower bound for finding the maximum of n integers allowing infinitely many processors of any PRAM without simultaneous writes. Finding the maximum of n integers is constant-time reducible to the hidden-line problem by using n processors. Therefore the hidden-line algorithm is time optimal.[17]

References

  1. ↑ L. G. Roberts. Machine perception of three-dimensional solids. PhD thesis, Massachusetts Institute of Technology, 1963.
  2. ↑ I. E. Sutherland. Ten unsolved problems in computer graphics. Datamation, 12(5):22–27, 1966.
  3. 1 2 3 4 5 F. Devai. Quadratic bounds for hidden line elimination. In Proc. 2nd Annual Symp. on Computational Geometry, SCG ’86, pp 269–275, New York, NY, USA, 1986.
  4. 1 2 A. Appel. The notion of quantitative invisibility and the machine rendering of solids. In Proc. 22nd National Conference, ACM ’67, pp 387–393, New York, NY, USA, 1967.
  5. ↑ R. Galimberti and U. Montanari. An algorithm for hidden line elimination. Commun. ACM, 12(4):206–211, April 1969.
  6. ↑ Ch. Hornung. An approach to a calculation-minimized hidden line algorithm. Computers & Graphics, 6(3):121–126, 1982.
  7. ↑ P. P. Loutrel. A solution to the hidden-line problem for computer-drawn polyhedra. IEEE Trans. Comput., 19(3):205–213, March 1970.
  8. ↑ J. F. Blinn. Fractional invisibility. IEEE Comput. Graph. Appl., 8(6):77–84, November 1988.
  9. 1 2 Th. Ottmann and P. Widmayer. Solving visibility problems by using skeleton structures. In Proc. Mathematical Foundations of Computer Science 1984, pp 459–470, London, UK, 1984. Springer-Verlag.
  10. 1 2 Th. Ottmann, P.Widmayer, and D.Wood. A worst-case efficient algorithm for hidden-line elimination. Internat. J. Computer Mathematics, 18(2):93–119, 1985.
  11. 1 2 O. Nurmi. A fast line-sweep algorithm for hidden line elimination. BIT, 25:466–472, September 1985.
  12. ↑ M. L. Fredman and B.Weide. On the complexity of computing the measure of U[ai, bi]. Commun. ACM, 21:540–544, July 1978.
  13. ↑ M. McKenna. Worst-case optimal hidden-surface removal. ACM Trans. Graph., 6:19–28, January 1987.
  14. ↑ Sh. Ghali. A survey of practical object space visibility algorithms. SIGGRAPH Tutorial Notes, 1(2), 2001.
  15. ↑ F. Devai. An O(log N) parallel time exact hidden-line algorithm. Advances in Computer Graphics Hardware II, pp 65–73, 1988.
  16. ↑ J. H. Reif and S. Sen. An efficient output-sensitive hidden surface removal algorithm and its parallelization. In Proc. 4th Annual Symp. on Computational Geometry, SCG ’88, pp 193–200, New York, NY, USA, 1988.
  17. 1 2 F. Devai. An optimal hidden-surface algorithm and its parallelization. In Computational Science and Its Applications, ICCSA 2011, volume 6784 of Lecture Notes in Computer Science, pp 17–29. Springer Berlin/Heidelberg, 2011.
  18. ↑ S. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15:87–97, February 1986.

External links


This article is issued from Wikipedia - version of the Thursday, April 28, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.