Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computationalâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Shuo Liu, Stefano Carpin
- Robotics and Autonomous Systems
- 2016

We present two algorithms to efficiently determine the value of two grasp quality metrics formerly proposed in literature. Theâ€¦Â (More)

Is this relevant?

2004

2004

- HervÃ© BrÃ¶nnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
- Theor. Comput. Sci.
- 2004

A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount ofâ€¦Â (More)

Is this relevant?

2004

2004

- 2004

A bstract-In this paper, we present parallel algorithms to identifv (i.e., detect and enumerate) the extreme points of the convexâ€¦Â (More)

Is this relevant?

Review

2004

Review

2004

- R.V. Chadnov, A V Skvortsov
- Proceedings. The 8th Russian-Korean Internationalâ€¦
- 2004

In this paper, various convex hull algorithms are being analyzed. Various algorithms are comparedÂ

Is this relevant?

2002

2002

- HervÃ© BrÃ¶nnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
- LATIN
- 2002

An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additionalâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Timothy M. Chan
- Discrete & Computational Geometry
- 1996

We present simple output-sensitive algorithms that construct the convex hull of a set of n points in two or three dimensions inâ€¦Â (More)

Is this relevant?

1996

1996

This paper will present the implementation and comparison of new parallel algorithms for the convex hull problem. Theseâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- David Avis, David Bremner
- Symposium on Computational Geometry
- 1995

A convex polytope P can be speci ed in two ways as the convex hull of the vertex set V of P or as the intersection of the set Hâ€¦Â (More)

Is this relevant?

1993

1993

- Hla Min, Si-Qing Zheng
- SAC
- 1993

A point set S is said to be convex if for any two points p, q in S, the line segment pq is also in S. Any point r on the segmentâ€¦Â (More)

Is this relevant?

1991

1991

- Mujtaba R. Ghouse, Michael T. Goodrich
- SPAA
- 1991

We present a number of efficient parallel algorithms for constructing 2and 3-dimensional convex hulls on a randomized CRCW PRAMâ€¦Â (More)

Is this relevant?