The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Computing convolutions by reciprocal search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Hidden surface removal for rectangles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Arrangements of lines in 3-space: a data structure with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics (TOG)
Parallel algorithms for arrangements
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Hidden curve removal for free form surfaces
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient hidden surface removal for objects with small union size
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Algorithms for visibility computation on digital terrain models
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Fast computation of shadow boundaries using spatial coherence and backprojections
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Rectilinear geodesics in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Temporally coherent conservative visibility (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
Visibility culling using hierarchical occlusion maps
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Accelerated occlusion culling using shadow frusta
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Visibility sorting and compositing without splitting for image layer decompositions
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Finite-resolution hidden surface removal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient and small representation of line arrangements with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
An Improved Output-size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Binary-Space-Partitioned Images for Resolving Image-Based Visibility
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the twenty-second annual symposium on Computational geometry
Computer-Aided Design
Visibility maps of segments and triangles in 3D
Computational Geometry: Theory and Applications
Guarding curvilinear art galleries with edge or mobile guards
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Computational Geometry: Theory and Applications
Guarding curvilinear art galleries with vertex or point guards
Computational Geometry: Theory and Applications
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences
International Journal of Sensor Networks
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Visibility maps of segments and triangles in 3d
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Simultaneous precise solutions to the visibility problem of sculptured models
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
Mathematical and Computer Modelling: An International Journal
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
| Hi-index | 0.00 |
An O(n2) hidden-surface removal algorithm is shown. This is an improvement over the previous best worst-case performance of O(n2 log n). It has been established that the hidden-line and hidden-surface problems have an &OHgr;(n2) worst-case lower bound, so the algorithm is optimal. However, the algorithm is not output-size sensitive. Two corollaries to the result are (1) hidden-lines can be removed in optimal O(n2) time, and (2) the portion of a 3-D polyhedron visible from a given interior point is constructible in optimal O(n2) time.