THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL-Reference-Cited by-同舟云学术

THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL

Published:1999-04 Issue:02 Volume:09 Page:207-217
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

GROVE EDWARD F.¹,MURALI T. M.²,VITTER JEFFREY SCOTT²

Affiliation:

1. 946, Tamarack Lane #13, Sunnyvale, CA 94086, U.S.A

2. Center for Geometric Computing, Department of Computer Science, Duke University, Box 90129, Durham, NC 27708–0129, U.S.A

Abstract

We define a new model of complexity, called object complexity, for measuring the performance of hidden-surface removal algorithms. This model is more appropriate for predicting the performance of these algorithms on current graphics rendering systems than the standard measure of scene complexity used in computational geometry. We also consider the problem of determining the set of visible windows in scenes consisting of n axis-parallel windows in ℝ3. We present an algorithm that runs in optimal Θ(n log n) time. The algorithm solves in the object complexity model the same problem that Bern3 addressed in the scene complexity model.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195999000145

Reference13 articles.

1. Ray Shooting and Parametric Search

2. Hidden surface removal for rectangles

3. Generalized hidden surface removal

4. Efficient ray shooting and hidden surface removal

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimizing Visible Edges in Polyhedra;Graphs and Combinatorics;2023-09-14

2. THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS;International Journal of Computational Geometry & Applications;2012-08

3. Some Results for Elementary Operations;Lecture Notes in Computer Science;2009

4. An optimal algorithm for reporting visible rectangles;Information Processing Letters;2002-03