Recent results in art galleries (geometry)

TC Shermer - Proceedings of the IEEE, 1992 - ieeexplore.ieee.org
Two points in a polygon are called if the straight line between them lies entirely inside the
polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P …

Computational geometric methods in volumetric intersection for 3D reconstruction

P Srinivasan, P Liang, S Hackwood - Pattern Recognition, 1990 - Elsevier
Generation and analysis of 3D models is an important task that enables automatic
inspection, placement, and manipulation of physical objects by robotic systems. This work …

Characterizing and recognizing weak visibility polygons

SK Ghosh, A Maheshwari, SP Pal, S Saluja… - Computational …, 1993 - Elsevier
A polygon is said to be a weak visibility polygon if every point of the polygon is visible from
some point of an internal segment. In this paper we derive properties of shortest paths in …

Techniques for real-time generation of range images

CM Bastuscheck - 1989 IEEE Computer Society Conference on …, 1989 - computer.org
Twitter has already become an important facet of the social Web, allowing users and
organizations to share their ideas and subscribe to others' updates. Notably, it has been …

Guarding curvilinear art galleries with vertex or point guards

MI Karavelas, CD Tóth, EP Tsigaridas - Computational Geometry, 2009 - Elsevier
We study a variant of the classical art gallery problem, where an art gallery is modeled by a
polygon with curvilinear sides. We focus on piecewise-convex and piecewise-concave …

An algorithm for the extraction of the wire frame structure of a three-dimensional object

J Mukherjee, PP Das, BN Chatterji - Pattern Recognition, 1990 - Elsevier
In this paper we have presented an algorithm for the extraction of the wire frame structure of
a given 3-D object. The 3-D input object is assumed to be in a binary array. This object is first …

Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

MI Karavelas - Computational Geometry, 2011 - Elsevier
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the
edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise …

[HTML][HTML] A tight bound for point guards in piecewise convex art galleries

J Cano, CD Tóth, J Urrutia - Computational Geometry, 2013 - Elsevier
We consider the problem of guarding curvilinear art galleries. A Jordan arc a joining two
points, p and q, in the plane is called a convex arc if the closed curve obtained by joining a …

Guarding curvilinear art galleries with edge or mobile guards

MI Karavelas - Proceedings of the 2008 ACM symposium on Solid and …, 2008 - dl.acm.org
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the
edges of which are arcs of curves. We consider two types of guards: edge guards (these are …

Spatial occupancy recovery from a multiple-view range imaging system for path planning applications

D Jung, KK Gupta - … and Cybernetics. Intelligent Systems for the …, 1995 - ieeexplore.ieee.org
We strive to obtain full spatial occupancy descriptions of the workspace from multiple range
images acquired from different points of view. Such representations are highly suitable in …