© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/We study the Oß-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle ß. Given a set P of n points in the plane, we show how to maintain the Oß-hull of P while ß runs from 0 to p in T(n log n) time and O(n) space. With the same complexity, we also find the values of ß that maximize the area and the perimeter of the Oß-hull and, furthermore, we find the value of ß achieving the best fitting of the point set P with a two-joint chain of alternate interior angle ß.Peer Reviewe
This abstract reports first the study of upper and lower bounds for the maximum number of all the co...
In this paper we determine the computational complexity of the dynamic convex hull problem in the pl...
An in-place algorithm is one in which the output is given in the same location as the input and only...
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
Let P be a set of n points in the plane and O be a set of k, 2 ≤ k ≤ n, different orientations in th...
In this paper we present a new algorithm for finding the convex hull C(P) for P sets of n points in ...
We continue the investigation of computational aspects of restricted-orientation convexity (O-convex...
AbstractWe study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n point...
A set of planar objects is said to be of type m if the convex hull of any two objects has its size b...
Finding the convex hull of a finite set of points is important not only for practical applications b...
Finding the convex hull of a finite set of points is important not only for practical applications b...
AbstractA space-efficient algorithm is one in which the output is given in the same location as the ...
All possible convex hull (i.e. the minimum area convex polygon containing the planar set) algorithms...
A space-efficient algorithm is one in which the output is given in the same location as the input an...
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
This abstract reports first the study of upper and lower bounds for the maximum number of all the co...
In this paper we determine the computational complexity of the dynamic convex hull problem in the pl...
An in-place algorithm is one in which the output is given in the same location as the input and only...
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
Let P be a set of n points in the plane and O be a set of k, 2 ≤ k ≤ n, different orientations in th...
In this paper we present a new algorithm for finding the convex hull C(P) for P sets of n points in ...
We continue the investigation of computational aspects of restricted-orientation convexity (O-convex...
AbstractWe study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n point...
A set of planar objects is said to be of type m if the convex hull of any two objects has its size b...
Finding the convex hull of a finite set of points is important not only for practical applications b...
Finding the convex hull of a finite set of points is important not only for practical applications b...
AbstractA space-efficient algorithm is one in which the output is given in the same location as the ...
All possible convex hull (i.e. the minimum area convex polygon containing the planar set) algorithms...
A space-efficient algorithm is one in which the output is given in the same location as the input an...
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
This abstract reports first the study of upper and lower bounds for the maximum number of all the co...
In this paper we determine the computational complexity of the dynamic convex hull problem in the pl...
An in-place algorithm is one in which the output is given in the same location as the input and only...