Generalized hidden surface removal

M. Berg, de

doi:10.1016/0925-7721(95)00008-9

Generalized hidden surface removal

M. Berg, de

Research output: Contribution to journal › Article › Academic › peer-review

6 Citations (Scopus)

Abstract

In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove tight bounds on the maximum combinatorial complexity of such views and give efficient output-sensitive algorithms to compute the views for three cases: (i) S consists of non-intersecting triangles, (ii) S consists of horizontal axis-parallel rectangles, (iii) S is the set of faces of a polyhedral terrain.

Original language	English
Pages (from-to)	249-276
Number of pages	28
Journal	Computational Geometry
Volume	5
Issue number	5
DOIs	https://doi.org/10.1016/0925-7721(95)00008-9
Publication status	Published - 1996

Access to Document

10.1016/0925-7721(95)00008-9

Cite this

@article{6e9dc00199c349fa8840069f9ffb1630,

title = "Generalized hidden surface removal",

abstract = "In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove tight bounds on the maximum combinatorial complexity of such views and give efficient output-sensitive algorithms to compute the views for three cases: (i) S consists of non-intersecting triangles, (ii) S consists of horizontal axis-parallel rectangles, (iii) S is the set of faces of a polyhedral terrain.",

author = "{Berg, de}, M.",

year = "1996",

doi = "10.1016/0925-7721(95)00008-9",

language = "English",

volume = "5",

pages = "249--276",

journal = "Computational Geometry",

issn = "0925-7721",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Generalized hidden surface removal

AU - Berg, de, M.

PY - 1996

Y1 - 1996

N2 - In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove tight bounds on the maximum combinatorial complexity of such views and give efficient output-sensitive algorithms to compute the views for three cases: (i) S consists of non-intersecting triangles, (ii) S consists of horizontal axis-parallel rectangles, (iii) S is the set of faces of a polyhedral terrain.

AB - In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove tight bounds on the maximum combinatorial complexity of such views and give efficient output-sensitive algorithms to compute the views for three cases: (i) S consists of non-intersecting triangles, (ii) S consists of horizontal axis-parallel rectangles, (iii) S is the set of faces of a polyhedral terrain.

U2 - 10.1016/0925-7721(95)00008-9

DO - 10.1016/0925-7721(95)00008-9

M3 - Article

VL - 5

SP - 249

EP - 276

JO - Computational Geometry

JF - Computational Geometry

SN - 0925-7721

IS - 5

ER -

Generalized hidden surface removal

Abstract

Access to Document

Fingerprint

Cite this