Reconstructing visible regions from visible segments

DOI10.1007/BF01935050zbMath0621.68045OpenAlexW2008378065WikidataQ57699723 ScholiaQ57699723MaRDI QIDQ1090463

Varol Akman, William Randolph Franklin

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935050

zbMATH Keywords

cartographycomputer graphicspoint-locationgraph problemhidden surface algorithmsobject spacepolyhedral scenesreconstructing visible regions from visible edge segmentsstraight-edge planar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Reconstructing visible regions from visible segments

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing visible regions from visible segments
• Finding the intersection of two convex polyhedra
• Plane-sweep algorithms for intersecting geometric figures
• A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra

This page was built for publication: Reconstructing visible regions from visible segments