scientific article; zbMATH DE number 4065813
From MaRDI portal
Publication:3799261
zbMATH Open0653.52001MaRDI QIDQ3799261FDOQ3799261
Authors: Joseph O'Rourke 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
decompositioncomputational geometrytriangulationpolygonsmonotonestar-shapedspiralvisibility graphsart gallery theoremsconvex partitioning algorithms
Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Polyhedra and polytopes; regular figures, division of spaces (51M20) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Other problems of combinatorial convexity (52A37) Designs and configurations (05B99)
Cited In (only showing first 100 items - show all)
- Approximating maximum edge 2-coloring in simple graphs
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Efficient visibility queries in simple polygons
- Improved approximation for guarding simple galleries from the perimeter
- How to guard orthogonal polygons: diagonal graphs and vertex covers
- Geometric classification of triangulations and their enumeration in a convex polygon
- Computational complexity aspects of point visibility graphs
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Watchman routes under limited visibility
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Camera placement in integer lattices
- Finding the largest area axis-parallel rectangle in a polygon
- Pentagonal chains and annuli as models for designing nanostructures from cages
- Monitoring maximal outerplanar graphs
- A fixed-parameter algorithm for guarding 1.5D terrains
- Approximation algorithms for art gallery problems in polygons
- Computability and complexity of ray tracing
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Area requirement of visibility representations of trees
- Guarding a set of line segments in the plane
- On visibility and covering by convex sets
- Proper interval graphs and the guard problem
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- Art gallery theorems for guarded guards.
- Optimum watchman routes
- Cooperative mobile guards in grids
- Watchman tours for polygons with holes
- Triangulating a simple polygon in linear time
- Computing a shortest watchman path in a simple polygon in polynomial-time
- Visibility-based pursuit-evasion in a polygonal environment
- An efficient algorithm for finding a two-pair, and its applications
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field
- Orthogonal polygon reconstruction from stabbing information
- Covering a line segment with variable radius discs
- Shortest watchman routes in simple polygons
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
- Modem illumination of monotone polygons
- Guarding polyominoes, polycubes and polyhypercubes
- Experimental study on approximation algorithms for guarding sets of line segments
- Polygon exploration with time-discrete vision
- Visibility with multiple diffuse reflections
- On guarding the vertices of rectilinear domains
- Tiling polygons with parallelograms
- Strategies for polyhedral surface decomposition: an experimental study.
- Guarding a Polygon Without Losing Touch
- Approximation algorithms for a geometric set cover problem
- On \(k\)-convex polygons
- The art gallery theorem for polyominoes
- A nearly optimal algorithm for covering the interior of an art gallery
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
- Polygon guarding with orientation
- Guarding Exterior Region of a Simple Polygon
- A nearly optimal sensor placement algorithm for boundary coverage
- Triangulating a nonconvex polytope
- Covering orthogonal polygons with star polygons: The perfect graph approach
- Guarding polyhedral terrains
- \(K\)-vertex guarding simple polygons
- Guarding galleries and terrains
- Point-set embeddings of trees with given partial drawings
- 1.5D terrain guarding problem parameterized by guard range
- Computing the full visibility graph of a set of line segments
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- Edge guards in rectilinear polygons
- Randomized query processing in robot path planning
- Encompassing colored planar straight line graphs
- The orthogonal art gallery theorem with constrained guards
- Recognition and complexity of point visibility graphs
- On recognizing and characterizing visibility graphs of simple polygons
- Guarding in a simple polygon
- Efficient piecewise-linear function approximation using the uniform metric
- Perfect graphs and guarding rectilinear art galleries
- The partial visibility curve of the Feigenbaum cascade to chaos
- The zookeeper route problem
- Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
- Optimal movement of mobile sensors for barrier coverage of a planar region
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Generalized guarding and partitioning for rectilinear polygons
- A new upper bound for the VC-dimension of visibility regions
- Radial drawings of graphs: geometric constraints and trade-offs
- Title not available (Why is that?)
- A note on the contractions for orthogonal polygons
- Guarding disjoint triangles and claws in the plane
- Searching a polygonal region by a group of stationary \(k\)-searchers
- Approximating constrained tetrahedrizations
- Extension to Even Triangulations
- On local transformation of polygons with visibility properties.
- Approximation algorithms for decomposing octilinear polygons
- Obstacle numbers of graphs
- Algorithms for the decomposition of a polygon into convex polygons
- Two-floodlight illumination of convex polygons
- Guarding curvilinear art galleries with vertex or point guards
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- The searchlight problem for road networks
- Guarding rectangular art galleries
- Minimal link visibility paths inside a simple polygon
- Protecting convex sets
- Computational complexity of art gallery problems
- Approximation algorithms for terrain guarding.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799261)
