In mathematics, the convex hull or convex envelope of a set X of points in the Euclidean plane or Euclidean space is the smallest convex set thatâ€¦Â (More)

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

Highly Cited

1998

Highly Cited

1998

- Egon Balas
- Discrete Applied Mathematics
- 1998

In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumesâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa
- ACM Trans. Math. Softw.
- 1996

The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convexâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Hanif D. Sherali, Warren P. Adams
- Discrete Applied Mathematics
- 1994

This paper is concerned with the generation of tight equivalent representations for mixedinteger zero-one programming problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani
- Math. Program.
- 1993

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demandâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Hanif D. Sherali, Warren P. Adams
- SIAM J. Discrete Math.
- 1990

In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into aâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- David G. Kirkpatrick, Raimund Seidel
- SIAM J. Comput.
- 1986

We present a new planar convex hull algorithm with worst case time complexity O(n log H) where n is the size of the input set andâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Garret Swart
- J. Algorithms
- 1985

Finding the convex hull of a finite set of points in Euclidean space was one of the first problems explored in the field ofâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- A. Ardeshir Goshtasby, George C. Stockman
- IEEE Transactions on Systems, Man, andâ€¦
- 1985

Algorithms for matching two sets of points in a plane are given. These algorithms search in the parameter space and find theâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- William F. Eddy
- ACM Trans. Math. Softw.
- 1977

A new algorithm, CONVEX, that determines which points of a planar set are vertices of the convex hull of the set is presented. Itâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- Franco P. Preparata, S. J. Hong
- Commun. ACM
- 1977

The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presentedâ€¦Â (More)

Is this relevant?