Finding an ordinary conic and an ordinary hyperplane
| dc.creator | Devillers, Olivier | |
| dc.creator | Mukhopadhyay, Asish | |
| dc.date | 1999-09-27 | |
| dc.date.accessioned | 2026-07-07T03:24:22Z | |
| dc.date.available | 2026-07-07T03:24:22Z | |
| dc.description | Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al. In this note we extend this result in two directions. We first show how to use this algorithm to compute an ordinary conic, that is, a conic passing through exactly five points, assuming that all the points do not lie on the same conic. Both our proofs of existence and the consequent algorithms are simpler than previous ones. We next show how to compute an ordinary hyperplane in three and higher dimensions. | |
| dc.description | 7 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cs/9909017 | |
| dc.identifier | http://arxiv.org/abs/cs/9909017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33296 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2; I.3.5 | |
| dc.title | Finding an ordinary conic and an ordinary hyperplane | |
| dc.type | text |