Visibility (geometry)

Known as: Visible surface algorithms, Visibility problem, Visible connection 
Visibility is a mathematical abstraction of the real-life notion of visibility. Given a set of obstacles in the Euclidean space, two points in the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2018
051019742018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We describe here a method to compute the depth of a scene from a set of at least two images taken at known view-points. Our… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2009
2009
Direct volume rendering is an important tool for visualizing complex data sets. However, in the process of generating 2D images… (More)
Is this relevant?
2008
2008
This paper deals with the 3D shape estimation from silhouette cues of multiple moving objects in general indoor or outdoor 3D… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
An efficient depth image based rendering (DIBR) for generating arbitrary novel views is proposed. The proposed method fills the… (More)
  • table 1
Is this relevant?
2005
2005
In the recent past, the visibility problem in vision-based control has been widely investigated. The proposed solutions generally… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
In this paper, a new genetic-based stereo matching algorithm is presented. Our motivation is to improve the accuracy of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
EEciently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Finding and displaying silhouette edges is important in applications ranging from computer vision to nonphotorealistic rendering… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertices are the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1986
1986
We present a parallel algorithm to solve the visibility problem among n vertical segments in a plane, which can be implemented on… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Is this relevant?