Polyhedral terrain

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

Topic mentions per year

Topic mentions per year

1986-2018
0246819862018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Data conflation is a major issue in GIS: spatial data obtained from different sources, using different acquisition techniques… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2008
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain… (More)
  • figure 1
Is this relevant?
2005
2005
Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Site visibility analysis is an important research topic with many applications in Geographical Information Systems. This paper… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every… (More)
  • figure 4
  • figure 9
Is this relevant?
Highly Cited
1996
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Inmanyapplications itisimportant thatonecanview asceneat different levels of detail. More precisely, onewould like to visualize… (More)
  • figure 1
  • figure 3
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We consider the problem of bounding the complexity of the lowerenvelope of <?Pub Fmt italic>n<?Pub Fmt /italic> surface patches… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
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?