Finding an ordinary conic and an ordinary hyperplane - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Nordic Journal of Computing Year : 1999

Finding an ordinary conic and an ordinary hyperplane


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.
Fichier principal
Vignette du fichier
NJC.pdf (110.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00168174 , version 1 (24-08-2007)


  • HAL Id : inria-00168174 , version 1


Olivier Devillers, Asish Mukhopadhyay. Finding an ordinary conic and an ordinary hyperplane. Nordic Journal of Computing, 1999, 6, pp.462-468. ⟨inria-00168174⟩
143 View
162 Download


Gmail Facebook Twitter LinkedIn More