Reconstructing visible regions from visible segments (Q1090463): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Reconstructing visible regions from visible segments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the intersection of two convex polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Plane-sweep algorithms for intersecting geometric figures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3727415 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4775467 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01935050 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2008378065 / rank | |||
Normal rank |
Latest revision as of 09:43, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reconstructing visible regions from visible segments |
scientific article |
Statements
Reconstructing visible regions from visible segments (English)
0 references
1986
0 references
An algorithm is presented for reconstructing visible regions from visible edge segments in object space. This has applications in hidden surface algorithms operating on polyhedral scenes and in cartography. A special case of reconstruction can be formulated as a graph problem: ''Determine the faces of a straight-edge planar graph given in terms of its edges.'' This is accomplished in O(n log ) time using linear space for a graph with n edges, and is worst-case optimal. The graph may have separate components but the components must not contain each other. The general problem of reconstruction is then solved by applying our algorithm to each component in the containment relation.
0 references
point-location
0 references
computer graphics
0 references
reconstructing visible regions from visible edge segments
0 references
object space
0 references
hidden surface algorithms
0 references
polyhedral scenes
0 references
cartography
0 references
graph problem
0 references
straight-edge planar graph
0 references