In computational geometry, a polyhedral terrain in three-dimensional Euclidean space is a polyhedral surface that intersects every line parallel toâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Marc J. van Kreveld, Rodrigo I. Silveira
- Symposium on Computational Geometry
- 2009

Data conflation is a major issue in GIS: spatial data obtained from different sources, using different acquisition techniquesâ€¦Â (More)

Is this relevant?

2008

2008

- Hamid Zarrabi-Zadeh
- Inf. Process. Lett.
- 2008

We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrainâ€¦Â (More)

Is this relevant?

2005

2005

- Sasanka Roy, Sandip Das, Subhas C. Nandy
- STACS
- 2005

Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest pathâ€¦Â (More)

Is this relevant?

2004

2004

- Branko Kaucic, Borut Zalik
- International Journal of Geographical Informationâ€¦
- 2004

Site visibility analysis is an important research topic with many applications in Geographical Information Systems. This paperâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- MaurÃcio Marengoni, Bruce A. Draper, Allen R. Hanson, R. Sitaraman
- Image Vision Comput.
- 2000

The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that everyâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Enrico Puppo
- CCCG
- 1996

A model for the multiresolution decomposition of planar domains into triangles is introduced, which is more general than otherâ€¦Â (More)

Is this relevant?

1996

1996

The Art Gallery Problem is the problem of determining the number of observers necessary to cover an art gallery room such thatâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Mark de Berg, Katrin Dobrindt
- Symposium on Computational Geometry
- 1995

Inmanyapplications itisimportant thatonecanview asceneat different levels of detail. More precisely, onewould like to visualizeâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Dan Halperin, Micha Sharir
- Symposium on Computational Geometry
- 1993

We consider the problem of bounding the complexity of the lowerenvelope of <?Pub Fmt italic>n<?Pub Fmt /italic> surface patchesâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Richard B Cole, Micha Sharir
- J. Symb. Comput.
- 1989

In this paper we study several problems concerning the visibility of a polyhedral terrain ~r from a point (or several pointsâ€¦Â (More)

Is this relevant?