DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Polygon covering
Polygon covering
Integer Programming Models for the Quasi-Polyomino Strip Packing Problem
Covering Orthogonal Polygons with Star Polygons: the Perfect Graph Approach
Visibility Algorithms in the Plane
30 POLYGONS Joseph O’Rourke, Subhash Suri, and Csaba D
Cover-Decomposition and Polychromatic Numbers∗
Cover-Decomposition and Polychromatic Numbers
Geometric Optimization for Classification Problems
The NP-Hardness of Covering Points with Lines, Paths and Tours and Their Tractability with FPT-Algorithms
Integer Linear Programming Models for the Problem of Covering a Polygonal Region by Rectangles
Rectangle Blanket Problem: Binary Integer Linear Programming Formulation and Solution Algorithms
Point Visibility Graphs and Restricted-Orientation Polygon Covering / by David Dylan Bremner
Computational and Communication Complexity of Geometric Problems
Universid Ade De Sã O Pa
Visibility Properties of Polygons
Detecting Weakly Simple Polygons∗
Covering Grids and Orthogonal Polygons with Periscope Guards
The NP-Hardness of Covering Points with Lines, Paths and Tours and Their Tractability with FPT-Algorithms
The Class Cover Problem with Boxes
Top View
On a Linear Program for Minimum-Weight Triangulation∗
Geometric Optimization for Classification Problems
The Class Cover Problem with Boxes
Algorithms for Mobile Agents with Limited Capabilities