J. Katajainen and T. Pasanen. Stable minimum space partitioning in linear time. BIT, 32(4):580{ 585, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. Self-citation (Katajainen) (Correct)
No context found.
J. Katajainen and T. Pasanen. Stable minimum space partitioning in linear time. BIT, 32(4):580{ 585, 1992.
In-Place Planar Convex Hull Algorithms - Brönnimann, Iacono, Katajainen.. Self-citation (Katajainen) (Correct)
No context found.
J. Katajainen and T. A. Pasanen. Stable minimum space partitioning in linear time. BIT, 32(4):580-585, 1992.
Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. Self-citation (Katajainen) (Correct)
No context found.
J. Katajainen, T. Pasanen, Stable minimum space partitioning in linear time, BIT 32 (4) (1992) 580--585.
Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. Self-citation (Katajainen) (Correct)
....the best of our knowledge, this paper is the rst to study the problem of computing convex hulls using space ecient algorithms. This seems surprising, given the close relation between planar convex hulls and sorting, and the large body of literature on space ecient sorting and merging algorithms [7 10, 12, 15, 16, 18 20, 23, 26, 31, 34, 35, 37]. The main reason for this is probably that the scan portion of Graham s original algorithm [13] is inherently in place, so in place sorting algorithms already provide an O(n log n) time in place convex hull algorithm. The remainder of the paper is organized as follows: In Sections 2, 3 and 4 the ....
....One can use an in place stable partitioning algorithm to partition A into the set of upper hull candidates and the set of lower hull candidates while preserving the sorted order within each set. There exists such a stable partitioning algorithm that runs in O(n) time and performs O(n) comparisons [18]. In this context, each comparison is actually a right turn test. Since the algorithm is stable, the original sorted order of the input is preserved and no additional sorting step is necessary. We call the resulting algorithm Sorted Graham InPlace Hull. Theorem 3 Sorted Graham InPlace Hull ....
J. Katajainen and T. Pasanen. Stable minimum space partitioning in linear time. BIT, 32(4):580{ 585, 1992.
In-Place Planar Convex Hull Algorithms - Brönnimann, Iacono, Katajainen.. Self-citation (Katajainen) (Correct)
....best of our knowledge, this paper is the rst to study the problem of computing convex hulls using in situ and in place algorithms. This seems surprising, given the close relation between planar convex hulls and sorting, and the large body of literature on in situ sorting and merging algorithms [7,8,9,10,12,15,16,19,20,18,23,26,30,33,34,36]. The remainder of the paper is organized as follows: Sections 2, 3 and 4 describe our rst, second and third algorithms, respectively. Section 5 summarizes and concludes with open problems. 2 An O(n log n) Time Algorithm In this section, we present a simple in place implementation of Graham s ....
....are necessary. One can use an in place stable partitioning algorithm to partition A into the set of upper hull candidates and the set of lower hull candidates while preserving the sorted order within each set. There exists such an algorithm that runs in O(n) time and perform O(n) comparisons [19]. We call this algorithm Sorted Graham InPlace Hull Theorem 3 Sorted Graham InPlace Hull computes the convex hull of n points given in lexicographic order in O(n) time using O(n) right turn tests, O(n) swaps, no lexicographic comparisons and O(1) additional memory. 3 An O(n log h) Time Recursive ....
J. Katajainen and T. A. Pasanen. Stable minimum space partitioning in linear time. BIT, 32(4):580-585, 1992.
Space-Efficient Algorithms for Computing the Convex Hull of.. - Brönnimann, Chan (Correct)
No context found.
J. Katajainen and T. Pasanen. Stable minimum space partitioning in linear time. BIT 32:580-585, 1992.
Space-Efficient Geometric Divide-and-Conquer Algorithms - Bose, Maheshwari, Morin, .. (2004) (Correct)
No context found.
J. Katajainen and T. Pasanen. Stable minimum space partitioning in linear time. BIT, 32:580--585, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC