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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.