# Axioms and Hulls

@inproceedings{Knuth1992AxiomsAH, title={Axioms and Hulls}, author={Donald Ervin Knuth}, booktitle={Lecture Notes in Computer Science}, year={1992} }

Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing axioms and hulls as the reading material.

## Topics from this paper

## 252 Citations

Convexity in Discrete Space

- Computer Science, MathematicsCOSIT
- 2003

This paper looks at Coppel’s axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell complexes.…

Implementing Euclid’s straightedge and compass constructions in type theory

- Computer ScienceAnnals of Mathematics and Artificial Intelligence
- 2018

This paper outlines the implementation of Euclidean geometry based on straightedge and compass constructions in the intuitionistic type theory of the Nuprl proof assistant, which enables a concise and intuitive expression of Euclid’s constructions.

Similar triangles and orientation in plane elementary geometry for Coq-based proofs

- Computer ScienceSAC '10
- 2010

This paper presents the formalization of the notion of orientation and its properties and how they are applied to the proof of two theorems: the Ptolemy's theorem and the Intersecting Chords theorem in Coq.

Geometric Graphs and Arrangements

- Mathematics
- 2004

Preface The body of this text is written. It remains to find some words to explain what to expect in this book. A first attempt of characterizing the content could be: In words: The questions posed…

Designing and proving correct a convex hull algorithm with hypermaps in Coq

- Computer Science, MathematicsComput. Geom.
- 2012

This article presents the formal design of a functional algorithm which computes the convex hull of a finite set of points incrementally. This algorithm, specified in Coq, is then automatically…

Extreme point and halving edge search in abstract order types

- Mathematics, Computer ScienceComput. Geom.
- 2013

It is shown that one can find a halving line through any given point, as well as the vertices of the convex hull edges that are intersected by the supporting line of any two given points of the set in linear time.

Reprint of: Extreme point and halving edge search in abstract order types

- Computer Science, MathematicsComput. Geom.
- 2014

It is shown that one can find a halving line through any given point, as well as the vertices of the convex hull edges that are intersected by the supporting line of any two given points of the set in linear time.

Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry

- Computer Science, MathematicsAutomated Deduction in Geometry
- 2000

The Calculus of inductive constructions and the system Coq are used to specify geometric concepts and to study and interactively handle proofs for the first two groups of Hilbert's axiomatics.

Oriented matroids as a foundation for space in GIS

- Computer Science, MathematicsComput. Environ. Urban Syst.
- 2007

This work provides an expository account, from the viewpoint of geographic information science, of oriented matroids, which are purely finite combinatorial structures that make no mention of R n or Q n, even though the intended models are finite subsets of these spaces.

Computational Geometry Column 62

- Mathematics, Computer ScienceSIGA
- 2015

The foundations of those completeness proofs are described, in particular Mnëv's Universality Theorem, as well as some known ⇿R-completeness results, and recent additions to the list.