Title of article :
Sweeping an oval to a vanishing point
Author/Authors :
Adrian Dumitrescu، نويسنده , , Minghui Jiang، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Abstract :
Given a convex region in the plane, and a sweep-line as a tool, what is the best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in . Here we consider the following slanted variant of sweeping recently introduced in : in a single sweep, the sweep-line is placed
Keywords :
Sweep-line , Approximation algorithm , Figure of constant width , Convex polygon
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics