Extraction of cylinders and cones from minimal point sets

03/15/2016
by   Laurent Busé, et al.
0

We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being oriented, or through a set of five simple points. We are also interested in computing efficiently cones through a set of two oriented points, through a set of four points, one of them being oriented, or through a set of six points. For these different interpolation problems, we give optimal bounds on the number of solutions. Moreover, we describe algebraic methods targeted to solve these problems efficiently.

READ FULL TEXT
research
06/29/2023

Oriented Spanners

Given a point set P in the Euclidean plane and a parameter t, we define ...
research
05/21/2019

Lonely Points in Simplices

Given a lattice L in Z^m and a subset A of R^m, we say that a point in A...
research
05/13/2022

On Fekete Points for a Real Simplex

We survey what is known about Fekete points/optimal designs for a simple...
research
12/09/2019

Algebraic k-sets and generally neighborly embeddings

Given a set S of n points in R^d, a k-set is a subset of k points of S t...
research
08/24/2020

Computing the Real Isolated Points of an Algebraic Hypersurface

Let ℝ be the field of real numbers. We consider the problem of computing...
research
08/24/2022

Halving by a Thousand Cuts or Punctures

For point sets P_1, …, P_, a set of lines L is halving if any face of t...
research
03/24/2019

PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility

We present a complete classification of all minimal problems for generic...

Please sign up or login with your details

Forgot password? Click here to reset