Results 1 
3 of
3
Spaceefficient planar convex hull algorithms
 Proc. Latin American Theoretical Informatics
, 2002
"... A spaceefficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four spaceefficient algorithms for computing the convex hull of a planar point set. ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
A spaceefficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four spaceefficient algorithms for computing the convex hull of a planar point set.
Computational Geometry
 in Directions in Computational Geometry
, 1994
"... Computational geometry, the study of algorithms involving relatively simple geometric objects, is an active, exciting field. This chapter samples current research in computational geometry. Three topics are discussed at some length: the theory of arrangements, a randomincremental convex hull alg ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Computational geometry, the study of algorithms involving relatively simple geometric objects, is an active, exciting field. This chapter samples current research in computational geometry. Three topics are discussed at some length: the theory of arrangements, a randomincremental convex hull algorithm, and robustness of geometric algorithms. 1 Introduction As pointed out by Robin Forrest and others[39, 79], the term "computational geometry" could be used for a variety of fields, including geometric modeling using curves and surfaces, computer proofs of geometric theorems, geometric design software, and the theory of perceptrons[71]. The purpose of this chapter is to give an impressionistic view of recent research in computational geometry, defined as the study of algorithms involving relatively simple geometric objects such as points and lines. A typical topic in this field is the analysis of an algorithm involving n objects in d dimensions; examples are the computation of the c...
Optimal inplace planar convex hull algorithms
 Proceedings of Latin American Theoretical Informatics (LATIN 2002), volume 2286 of Lecture Notes in Computer Science
, 2002
"... An inplace algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three inplace algorithms for computing the convex hull of a planar point set. All three algorithms are optima ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
An inplace algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three inplace algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others...