Article

Free access

Quadratic bounds for hidden line elimination

Author:

F DevaiAuthors Info & Claims

SCG '86: Proceedings of the second annual symposium on Computational geometry

Pages 269 - 275

https://doi.org/10.1145/10515.10544

Published: 01 August 1986 Publication History

PDF eReader

References

[1]

Appel, A. The notion of quantitative invisibility and the machine rendering of solids. Proc. ACM National Conference, 1967, 307-393.

Digital Library

Google Scholar

[2]

Ben-Or, ~4. Lower bounds for algebraic computation trees. Proc. 15th ACM Annu. Syrup. Theory Comput. (Apr. 1983), 80-86.

Digital Library

Google Scholar

[3]

Bondy, J.A., Murty, U.S.R. Graph ?heory With Applications. The Macmillan Press LTD. London, 1977.

Digital Library

Google Scholar

[4]

Chazelle, B., Guibas, L.J., Lee, D.T. The power of geometric duality. Proc. 24th Annual Symp. on Foundations of Comp. Sci. Tucson, Arizona, (Nov. 1983), 217-225.

Digital Library

Google Scholar

[5]

D~vai, F. Complexity of visibility computations. Dissertation for the degree of Candidate of Sciences. Budapest, Hungary, 1981 (In Hungarian) .

Google Scholar

[6]

D~vai, F. Complexity of two-dimensional visibility computations. Proc. 3rd European conference on CAD'CAM and computer graphics, Paris, France, (Feb. 1984), MICAD'84 Vol. 3, 827-841.

Google Scholar

[7]

Edelsbrunner, H., O'Rourke, J., Seidel, R. Constructing arrangements of lines and hyperplanes with applications. Proc. 24th Annual Symp. on Foundations of Comp. Sci. Tucson, Arizona, (Nov. 1983), 83-91.

Digital Library

Google Scholar

[8]

Forrest, A.R. Computational geometry in practice. NATO ASI Series, Vol. F17, Fundamental Algorithms for Computer Graphics (Ed. R.A. Earnshaw) Springer-Verlag, Berlin 1985, 707-724.

Google Scholar

[9]

Franklin, W.R. A linear time exact hidden surface algorithm. Computer Graphics 14,3 (1980), 117-123.

Digital Library

Google Scholar

[10]

Fredx~an, M.L., Weide, B. On the complexity of computing the measure of U{ai,bi}. Comm. ACM 21,7 (July 1978), 540-544.

Digital Library

Google Scholar

[11]

Galimberti, R. Montanari, U. An algorithm for hidden-line elimination. Comm. ACM 12,4 (Appr. 1969), 206-211.

Digital Library

Google Scholar

[12]

Haj6s Gy. Introduction to Geometry. Tank6nyvkida6, Budapest, 1972 (In Hungarian).

Google Scholar

[13]

Hilbert, D., Cohn-Vossen, S. Geometry and the Imagination. Chelsea Publishing Co., New York, 1952.

Google Scholar

[14]

Loutrel, P.P. A solution to the hidden-line problem for computer drawn polyhedra. IEEE Trans. Comp. C-19,3 (Mar. 1970), 205-213.

Digital Library

Google Scholar

[15]

Nurmi, O. A fast line-sweep algorithm for hidden line elimination. BIT 25 (1985), 466-472.

Digital Library

Google Scholar

[16]

Schmitt, A. Time and space bounds for hidden line and hidden surface algorithms. Proc. EUROGRAPHICS' 81, Darmstadt, FRG, (Sep. 1981), 43-56.

Google Scholar

[17]

Sutherland, I.E., Sproull, R.F., Schumaker, R.A. A characterization of ten hidden-surface algorithms. Computing Surveys 6,1 (1974), 1-55.

Digital Library

Google Scholar

[18]

Weiler, K., Atherton, P. Hidden surface removal using polygon area sorting. Computer Graphics 11,2 (Summer 1977), 21 4-222.

Digital Library

Google Scholar

[19]

Welzl, E. Constructing the visibility graph for n line segments in O(n2) time. Information Processing Lett. 20 (1985), 167-171.

Crossref

Google Scholar

Cited By

View all

Chen GBaek SFlorez JQian WLeigh SHutchinson SDellaert F(2022)GTGraffiti: Spray Painting Graffiti Art from Human Painting Motions with a Cable Driven Parallel Robot2022 International Conference on Robotics and Automation (ICRA)10.1109/ICRA46639.2022.9812008(4065-4072)Online publication date: 23-May-2022
https://doi.org/10.1109/ICRA46639.2022.9812008
Alipour SGhodsi MGüdükbay UGolkari M(2017)Approximation algorithms for visibility computation and testing over a terrainApplied Geomatics10.1007/s12518-016-0180-99:1(53-59)Online publication date: 6-Jan-2017
https://doi.org/10.1007/s12518-016-0180-9
Rabban IAbdullah KAhmed SRahman M(2014)An easier approach to visible edge determination from moving viewpoint2014 International Conference on Electrical Engineering and Information & Communication Technology10.1109/ICEEICT.2014.6919150(1-5)Online publication date: Apr-2014
https://doi.org/10.1109/ICEEICT.2014.6919150
Show More Cited By

Index Terms

Quadratic bounds for hidden line elimination

Recommendations

A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

Based on an augmented Lagrangian line search function, a sequential quadratically constrained quadratic programming method is proposed for solving nonlinearly constrained optimization problems. Compared to quadratic programming solved in the traditional ...
The haloed line effect for hidden line elimination.

The haloed line effect is a technique where when a line in three-dimensional space passes in front of another line, a gap is produced in the projection of the more distant line. The gap is produced as if an opaque halo surrounded the closer line. This ...
The haloed line effect for hidden line elimination.
SIGGRAPH '79: Proceedings of the 6th annual conference on Computer graphics and interactive techniques

The haloed line effect is a technique where when a line in three-dimensional space passes in front of another line, a gap is produced in the projection of the more distant line. The gap is produced as if an opaque halo surrounded the closer line. This ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SCG '86: Proceedings of the second annual symposium on Computational geometry

August 1986

322 pages

ISBN:0897911946

DOI:10.1145/10515

Chairman:
Alok Aggarwal

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CG86

Sponsor:

CG86: The 2nd Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry

June 2 - 4, 1986

New York, Yorktown Heights, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
480
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)5

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen GBaek SFlorez JQian WLeigh SHutchinson SDellaert F(2022)GTGraffiti: Spray Painting Graffiti Art from Human Painting Motions with a Cable Driven Parallel Robot2022 International Conference on Robotics and Automation (ICRA)10.1109/ICRA46639.2022.9812008(4065-4072)Online publication date: 23-May-2022
https://doi.org/10.1109/ICRA46639.2022.9812008
Alipour SGhodsi MGüdükbay UGolkari M(2017)Approximation algorithms for visibility computation and testing over a terrainApplied Geomatics10.1007/s12518-016-0180-99:1(53-59)Online publication date: 6-Jan-2017
https://doi.org/10.1007/s12518-016-0180-9
Rabban IAbdullah KAhmed SRahman M(2014)An easier approach to visible edge determination from moving viewpoint2014 International Conference on Electrical Engineering and Information & Communication Technology10.1109/ICEEICT.2014.6919150(1-5)Online publication date: Apr-2014
https://doi.org/10.1109/ICEEICT.2014.6919150
Dévai F(2011)An optimal hidden-surface algorithm and its parallelizationProceedings of the 2011 international conference on Computational science and its applications - Volume Part III10.5555/2029312.2029314(17-29)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.5555/2029312.2029314
Dévai F(2011)An Optimal Hidden-Surface Algorithm and Its ParallelizationComputational Science and Its Applications - ICCSA 201110.1007/978-3-642-21931-3_2(17-29)Online publication date: 2011
https://doi.org/10.1007/978-3-642-21931-3_2
Ben-Moshe BCarmi PKatz M(2008)Approximating the Visible Region of a Point on a TerrainGeoinformatica10.1007/s10707-006-0017-512:1(21-36)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1007/s10707-006-0017-5
Keeler TFedorkiw JGhali S(2007)The spherical visibility mapComputer-Aided Design10.1016/j.cad.2006.08.00739:1(17-26)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1016/j.cad.2006.08.007
Dalal SDevai FRahman M(2006)High-Performance Rendering on Clusters of WorkstationsProceedings of the conference on Geometric Modeling and Imaging: New Trends10.1109/GMAI.2006.27(22-27)Online publication date: 5-Jul-2006
https://dl.acm.org/doi/10.1109/GMAI.2006.27
Berg M(2005)Visualization of TINsAlgorithmic Foundations of Geographic Information Systems10.1007/3-540-63818-0_4(79-97)Online publication date: 9-Jun-2005
https://doi.org/10.1007/3-540-63818-0_4
Magillo PFloriani LBruzzone E(2005)Updating visibility information on multiresolut ion terrain modelsSpatial Information Theory A Theoretical Basis for GIS10.1007/3-540-60392-1_18(279-296)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60392-1_18
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

The haloed line effect for hidden line elimination.

The haloed line effect for hidden line elimination.