Smooth Surfaces via Nets of Geodesics

09/03/2021
by   Tom Gilat, et al.
0

This work presents an algorithm for the computation and visualization of an underlying unknown surface from a given net of geodesics. It is based on a theoretical result by the author regarding minimal Gaussian curvature surfaces with geodesic boundary conditions. The novelty of the method is that it consists of the computation of each patch in the net independently with the union of the patches being a smooth surface. This complements a seminal work by the late David Knill, which suggests that the human visual system infers different objects by markings along geodesics on their surface.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2017

Discrete Geodesic Nets for Modeling Developable Surfaces

We present a discrete theory for modeling developable surfaces as quadri...
research
02/03/2016

Smooth surface interpolation using patches with rational offsets

We present a new method for the interpolation of given data points and a...
research
09/05/2020

Trimmed Spline Surfaces with Accurate Boundary Control

We introduce trimmed NURBS surfaces with accurate boundary control, brie...
research
07/01/2023

Internal-External Boundary Attention Fusion for Glass Surface Segmentation

Glass surfaces of transparent objects and mirrors are not able to be uni...
research
06/12/2006

Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches

In this paper, we give several simple methods for drawing a whole ration...
research
01/07/2022

As-Continuous-As-Possible Ceramics Printing for Shell Models

We propose a novel computational framework for fabricating thin shell mo...
research
06/14/2021

Toward Automatic Interpretation of 3D Plots

This paper explores the challenge of teaching a machine how to reverse-e...

Please sign up or login with your details

Forgot password? Click here to reset