C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Optimally computing a shortest weakly visible line segment inside a simple polygon.
Binay K. Bhattacharya
Gautam Das
Asish Mukhopadhyay
Giri Narasimhan
Published in:
Comput. Geom. (2002)
Keyphrases
</>
line segments
simple polygon
endpoints
hough transform
digital pictures
convex hull
straight line
medial axis
ellipse detection
line detection
shortest path
line correspondences
straight line segments
perspective images
aerial images
medical imaging
viewpoint
image segmentation
data sets