The DOI matches its Crossref record.
Linear programming and convex hulls made easy
Open accessAbstract
We present two randomized algorithms. One solves linear programs involving m constraints in d variables in expected time Ο(m). The other constructs convex hulls of n points in Rd, d > 3, in expected time Ο(n⌈d/2⌉). In both bounds d is considered to be a constant. In the linear programming algorithm the dependence of the time bound on d is of the form d!. The main virtue of our results lies in the utter simplicity of the algorithms as well as their analyses.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Smallest enclosing disks (balls and ellipsoids)
Welzl, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038202 · Cited by 791
Fast distance queries with rectangular swept sphere volumes
Larsen, E., Gottschalk, S., Lin, M. C., & Manocha, D. (2002) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.845311 · Cited by 277
Cutting hyperplanes for divide-and-conquer
Chazelle, B. (1993) · Discrete & Computational Geometry · doi:10.1007/bf02189314 · Cited by 270
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
Ehmann, S. A., & Lin, M. C. (2001) · Computer Graphics Forum · doi:10.1111/1467-8659.00543 · Cited by 264
Metadata
- Authors
- Seidel, R.
- Venue
- Proceedings of the sixth annual symposium on Computational geometry - SCG '90
- Publisher
- ACM Press
- Published
- 1990
- Pages
- 211-215
- OpenAlex
- W2158130976
- Cited by
- 166
- References
- 0
- FWCI
- 7.61
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear programming and convex hulls made easy. https://app.cochat.ai/papers/10.1145/98524.98570
- The paper
- Seidel, R. (1990). Linear programming and convex hulls made easy. Proceedings of the sixth annual symposium on Computational geometry - SCG '90. https://doi.org/10.1145/98524.98570
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.