Skip to Main content Skip to Navigation
Journal articles

Finding an ordinary conic and an ordinary hyperplane

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Friday, August 24, 2007 - 6:09:28 PM
Last modification on : Friday, February 4, 2022 - 3:21:33 AM
Long-term archiving on: : Thursday, April 8, 2010 - 9:26:41 PM


Files produced by the author(s)


  • HAL Id : inria-00168174, version 1



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



Record views


Files downloads