About the Serpinsky-Knopp curve

03/03/2020
by   Evgeny Shchepin, et al.
0

The Serpinsky-Knopp curve is characterized as the only curve (up to isometry) that maps a unit segment onto a triangle of a unit area, so for any pair of points in the segment, the square of the distance between their images does not exceed four times the distance between them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2022

Efficient Fréchet distance queries for segments

We study the problem of constructing a data structure that can store a t...
research
12/21/2018

Polygonal approximation of digital planar curve using novel significant measure

This paper presents an iterative smoothing technique for polygonal appro...
research
05/01/2019

A convex cover for closed unit curves has area at least 0.0975

We combine geometric methods with numerical box search algorithm to show...
research
06/23/2020

Steiner's Hat: a Constant-Area Deltoid Associated with the Ellipse

The Negative Pedal Curve (NPC) of the Ellipse with respect to a boundary...
research
07/21/2020

Static and Streaming Data Structures for Fréchet Distance Queries

Given a curve P with points in ℝ^d in a streaming fashion, and parameter...
research
03/16/2021

Uncertain Curve Simplification

We study the problem of polygonal curve simplification under uncertainty...
research
08/20/2020

A Special Conic Associated with the Reuleaux Negative Pedal Curve

The Negative Pedal Curve of the Reuleaux Triangle w.r. to a point M on i...

Please sign up or login with your details

Forgot password? Click here to reset