Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.01390 v1 pith:KKQ6UOVQ submitted 2020-03-03 math.MG cs.CG

About the Serpinsky-Knopp curve

classification math.MG cs.CG
keywords curvedistancesegmentserpinsky-knoppunitareacharacterizedexceed
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.