Maximum Rectilinear Convex Subsets
Abstract
References
Recommendations
Maximum Rectilinear Convex Subsets
Fundamentals of Computation TheoryAbstractLet P be a set of n points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with running time and space complexity that compute: (1) A subset S of P such that the boundary of the ...
Computing minimum-area rectilinear convex hull and L-shape
We study the problems of computing two non-convex enclosing shapes with the minimum area; the L-shape and the rectilinear convex hull. Given a set of n points in the plane, we find an L-shape enclosing the points or a rectilinear convex hull of the ...
The Maximum Number of Faces of the Minkowski Sum of Two Convex Polytopes
We derive tight bounds for the maximum number of k-faces, $$0\le k\le d-1$$0≤k≤d-1, of the Minkowski sum, $$P_1+P_2$$P1+P2, of two d-dimensional convex polytopes $$P_1$$P1 and $$P_2$$P2, as a function of the number of vertices of the polytopes. For even ...
Comments
Information & Contributors
Information
Published In
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Author Tags
Author Tag
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in