Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fairing of Discrete Planar Curves by Integrable Discrete Analogue of Euler's Elasticae

Published 1 Nov 2021 in nlin.SI | (2111.00804v1)

Abstract: We construct a method to fair a given discrete planar curve by using the integrable discrete analogue of Euler's elastica, which is a discrete version of the approximation algorithm presented by D. Brander, et al. We first give a brief review of the integrable discrete analogue of Euler's elastica proposed by A. I. Bobenko and Yu. B. Suris, then we present a detailed account of the fairing algorithm, and we apply this method to an architectural problem of characterizing the keylines of Japanese handmade pantiles.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.