On the number of intersection points of lines and circles in ℝ^3

05/28/2020
by   Andrey Sergunin, et al.
0

We consider the following question: Given n lines and n circles in ℝ^3, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no n^1/2 curves (lines or circles) lying on an algebraic surface of degree at most two, then the number of these intersection points is O(n^3/2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2020

On rich points and incidences with restricted sets of lines in 3-space

Let L be a set of n lines in R^3 that is contained, when represented as ...
research
05/26/2023

On regular sets of affine type in finite Desarguesian planes and related codes

In this paper, we consider point sets of finite Desarguesian planes whos...
research
04/10/2023

A generalization of tangent-based implicit curves

An approach to defining quadratic implicit curves is to prescribe two ta...
research
11/06/2019

On the Average Complexity of the k-Level

Let A be an arrangement of n lines in the Euclidean plane. The <i>k-leve...
research
01/08/2013

On Intersecting IFS Fractals with Lines

IFS fractals - the attractors of Iterated Function Systems - have motiva...
research
11/25/2008

String Art: Circle Drawing Using Straight Lines

An algorithm to generate the locus of a circle using the intersection po...
research
02/05/2019

A non-iterative method for robustly computing the intersections between a line and a curve or surface

The need to compute the intersections between a line and a high-order cu...

Please sign up or login with your details

Forgot password? Click here to reset