Ray shooting, depth orders and hidden surface removal [electronic resource] / Mark de Berg.
Computational geometry is the part of theoretical computer science that concerns itself with geometrical objects; it aims to define efficient algorithms for problems involving points, lines, polygons, and so on. The field has gained popularity very rapidly during the last decade. This is partly due...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
©1993.
|
| Series: | Lecture notes in computer science ;
703. |
| Subjects: |
Table of Contents:
- Computational geometry and computer graphics
- Preliminaries
- A general strategy
- Ray shooting from a fixed point
- Ray shooting into a fixed direction
- Ray shooting with arbitrary rays
- Conclusions
- Depth orders in the plane
- Depth orders in three dimensions
- Conclusions
- Non-intersecting polyhedra
- Intersecting polyhedra
- Dynamization
- Conclusions.