 |
 |
|
|
| inria-00168174, version 1 |
 |
|
|
|
| Voir la fiche détaillée |  BibTeX EndNote TEI RefWorks |
|
|
|||||||
| Nordic Journal of Computing 6 (1999) 462-468 |
|
| 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. |
|
|
|
|
|
|
|
|
|
| a – | |
| 1 : | GEOMETRICA (INRIA Sophia Antipolis) |
|
INRIA |
| 2 : | School of Computer Science |
|
University of Windsor |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Géométrie algorithmique |
| inria-00168174, version 1 | |
| http://hal.inria.fr/inria-00168174/fr/ | |
| oai:hal.inria.fr:inria-00168174_v1 | |
| Contributeur : Olivier Devillers | |
| Soumis le : Vendredi 24 Août 2007, 18:09:28 | |
| Dernière modification le : Vendredi 24 Août 2007, 20:26:42 | |
