Closed cap condition under the cap construction algorithm

10/01/2022
by   Mercedes Sandu, et al.
0

Every polygon P can be companioned by a cap polygon P̂ such that P and P̂ serve as two parts of the boundary surface of a polyhedron V. Pairs of vertices on P and P̂ are identified successively to become vertices of V. In this paper, we study the cap construction that asserts equal angular defects at these pairings. We exhibit a linear relation that arises from the cap construction algorithm, which in turn demonstrates an abundance of polygons that satisfy the closed cap condition, that is, those that can successfully undergo the cap construction process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2022

Simple Closed Quasigeodesics on Tetrahedra

Pogorelov proved in 1949 that every every convex polyhedron has at least...
research
04/02/2023

Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths

Two algorithms for construction of all closed knight's paths of lengths ...
research
04/09/2021

Efficient and Robust Discrete Conformal Equivalence with Boundary

We describe an efficient algorithm to compute a conformally equivalent m...
research
04/19/2021

Minimizing the total weighted pairwise connection time in network construction problems

It is required to find an optimal order of constructing the edges of a n...
research
11/20/2018

The domino problem is undecidable on surface groups

We show that the domino problem is undecidable on orbit graphs of non-de...
research
11/06/2022

Approximate Graph Colouring and the Hollow Shadow

We show that approximate graph colouring is not solved by constantly man...
research
10/26/2021

From SKA to SKAO: Early Progress in the SKAO Construction

The Square Kilometre Array telescopes have recently started their constr...

Please sign up or login with your details

Forgot password? Click here to reset