Systematic approach to triangulation closed combinatorial surfaces Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Is there are a name for a simplicial complex that is homotopic to the clique complex of its 1-skeleton?Partitioning a triangulated 2-sphere into two triangulated discstriangulation of the closed discGenerator for homology of surface of genus $g$ - Hatcher 2.2.29If you know that a shape tiles the plane, does it also tile other surfaces?Existence of subdivision of PL manifold triangulation which is combinatorial manifoldTriangulation of torus - understanding whyTriangulation to maximize the number of triangles, including those with points insideA question on triangulation of compact surfacesClosed Surfaces are combinatorial surfaces

Abandoning the Ordinary World

Why am I getting the error "non-boolean type specified in a context where a condition is expected" for this request?

How to tell that you are a giant?

When a candle burns, why does the top of wick glow if bottom of flame is hottest?

How to bypass password on Windows XP account?

Why did the IBM 650 use bi-quinary?

Identifying polygons that intersect with another layer using QGIS?

How to react to hostile behavior from a senior developer?

Is it ethical to give a final exam after the professor has quit before teaching the remaining chapters of the course?

Apollo command module space walk?

Why is my conclusion inconsistent with the van't Hoff equation?

Why are there no cargo aircraft with "flying wing" design?

What is the role of the transistor and diode in a soft start circuit?

How does the particle を relate to the verb 行く in the structure「A を + B に行く」?

String `!23` is replaced with `docker` in command line

What is Wonderstone and are there any references to it pre-1982?

Can I cast Passwall to drop an enemy into a 20-foot pit?

Storing hydrofluoric acid before the invention of plastics

Coloring maths inside a tcolorbox

Why light coming from distant stars is not discreet?

How do pianists reach extremely loud dynamics?

Sci-Fi book where patients in a coma ward all live in a subconscious world linked together

What LEGO pieces have "real-world" functionality?

How come Sam didn't become Lord of Horn Hill?



Systematic approach to triangulation closed combinatorial surfaces



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Is there are a name for a simplicial complex that is homotopic to the clique complex of its 1-skeleton?Partitioning a triangulated 2-sphere into two triangulated discstriangulation of the closed discGenerator for homology of surface of genus $g$ - Hatcher 2.2.29If you know that a shape tiles the plane, does it also tile other surfaces?Existence of subdivision of PL manifold triangulation which is combinatorial manifoldTriangulation of torus - understanding whyTriangulation to maximize the number of triangles, including those with points insideA question on triangulation of compact surfacesClosed Surfaces are combinatorial surfaces










0












$begingroup$


I was wondering whether there is a systematic approach to the triangulation of closed combinatorial surfaces, which we know can be shown to be homeomorphic to polygons with complete set of side identifications on the way to the classification theorem, or just more generally to the manifolds obtained from the sphere by adding $g$ handles or $h$ crosscaps.



Well, intuitively, we should be able to triangulate a handle/crosscap alone, and then we also know of a simple triangulation of the sphere (two tetrahedrons glued together on a side with the interior of that face removed), but what concerns is me whether such cut-paste of those separate triangulations would generally result in a triangulation of the desired space?



TL;DR: knowing that triangulations of closed combinatorial surfaces exist (by definition), do we know of a simple way to write those triangulations down, knowing the class of the surface given (i. e. $M_g$ or $N_h$)?



...starting from a polygon with a complete set of side identifications, say?










share|cite|improve this question









$endgroup$
















    0












    $begingroup$


    I was wondering whether there is a systematic approach to the triangulation of closed combinatorial surfaces, which we know can be shown to be homeomorphic to polygons with complete set of side identifications on the way to the classification theorem, or just more generally to the manifolds obtained from the sphere by adding $g$ handles or $h$ crosscaps.



    Well, intuitively, we should be able to triangulate a handle/crosscap alone, and then we also know of a simple triangulation of the sphere (two tetrahedrons glued together on a side with the interior of that face removed), but what concerns is me whether such cut-paste of those separate triangulations would generally result in a triangulation of the desired space?



    TL;DR: knowing that triangulations of closed combinatorial surfaces exist (by definition), do we know of a simple way to write those triangulations down, knowing the class of the surface given (i. e. $M_g$ or $N_h$)?



    ...starting from a polygon with a complete set of side identifications, say?










    share|cite|improve this question









    $endgroup$














      0












      0








      0





      $begingroup$


      I was wondering whether there is a systematic approach to the triangulation of closed combinatorial surfaces, which we know can be shown to be homeomorphic to polygons with complete set of side identifications on the way to the classification theorem, or just more generally to the manifolds obtained from the sphere by adding $g$ handles or $h$ crosscaps.



      Well, intuitively, we should be able to triangulate a handle/crosscap alone, and then we also know of a simple triangulation of the sphere (two tetrahedrons glued together on a side with the interior of that face removed), but what concerns is me whether such cut-paste of those separate triangulations would generally result in a triangulation of the desired space?



      TL;DR: knowing that triangulations of closed combinatorial surfaces exist (by definition), do we know of a simple way to write those triangulations down, knowing the class of the surface given (i. e. $M_g$ or $N_h$)?



      ...starting from a polygon with a complete set of side identifications, say?










      share|cite|improve this question









      $endgroup$




      I was wondering whether there is a systematic approach to the triangulation of closed combinatorial surfaces, which we know can be shown to be homeomorphic to polygons with complete set of side identifications on the way to the classification theorem, or just more generally to the manifolds obtained from the sphere by adding $g$ handles or $h$ crosscaps.



      Well, intuitively, we should be able to triangulate a handle/crosscap alone, and then we also know of a simple triangulation of the sphere (two tetrahedrons glued together on a side with the interior of that face removed), but what concerns is me whether such cut-paste of those separate triangulations would generally result in a triangulation of the desired space?



      TL;DR: knowing that triangulations of closed combinatorial surfaces exist (by definition), do we know of a simple way to write those triangulations down, knowing the class of the surface given (i. e. $M_g$ or $N_h$)?



      ...starting from a polygon with a complete set of side identifications, say?







      general-topology algebraic-topology surfaces polygons triangulation






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 26 at 17:04









      user35443user35443

      203213




      203213




















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          There is a simple answer to your question which ignores all of your remarks about handles and crosscaps. Starting from the polygon $P$, first form the 2nd barycentric subdivision of $P$, and then glue the sides of $P$. After gluing, the 2nd barycentric subdivision of $P$ becomes a triangulation of the surface.



          You may wonder: one knows what the 2nd barycentric subdivision of a triangulation is, but what is the 2nd barycentric subdivision of the polygon $P$? Let me assume for simplicity that $P$ is a regular polygon in the plane. The 1st barycentric subdivision of $P$ is the following triangulation of $P$. Its $0$-skeleton contains the original vertex set of $P$, plus some additional vertices, namely the midpoint $M_E$ of each edge of $P$ and the center $C$ of $P$. Its $1$-skeleton has two edges obtained from each edge $E$ by subdividing it at the point $M_E$, plus some additional edges, namely $CV$ for each vertex $V$ of $P$, and $CM_E$ for each edge of $E$. And now, as expected, the 2nd barycentric subdivision of $P$ is the 1st barycentric subdivision of its 1st barycentric subdivision.






          share|cite|improve this answer









          $endgroup$













            Your Answer








            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "69"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader:
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            ,
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3163478%2fsystematic-approach-to-triangulation-closed-combinatorial-surfaces%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            There is a simple answer to your question which ignores all of your remarks about handles and crosscaps. Starting from the polygon $P$, first form the 2nd barycentric subdivision of $P$, and then glue the sides of $P$. After gluing, the 2nd barycentric subdivision of $P$ becomes a triangulation of the surface.



            You may wonder: one knows what the 2nd barycentric subdivision of a triangulation is, but what is the 2nd barycentric subdivision of the polygon $P$? Let me assume for simplicity that $P$ is a regular polygon in the plane. The 1st barycentric subdivision of $P$ is the following triangulation of $P$. Its $0$-skeleton contains the original vertex set of $P$, plus some additional vertices, namely the midpoint $M_E$ of each edge of $P$ and the center $C$ of $P$. Its $1$-skeleton has two edges obtained from each edge $E$ by subdividing it at the point $M_E$, plus some additional edges, namely $CV$ for each vertex $V$ of $P$, and $CM_E$ for each edge of $E$. And now, as expected, the 2nd barycentric subdivision of $P$ is the 1st barycentric subdivision of its 1st barycentric subdivision.






            share|cite|improve this answer









            $endgroup$

















              2












              $begingroup$

              There is a simple answer to your question which ignores all of your remarks about handles and crosscaps. Starting from the polygon $P$, first form the 2nd barycentric subdivision of $P$, and then glue the sides of $P$. After gluing, the 2nd barycentric subdivision of $P$ becomes a triangulation of the surface.



              You may wonder: one knows what the 2nd barycentric subdivision of a triangulation is, but what is the 2nd barycentric subdivision of the polygon $P$? Let me assume for simplicity that $P$ is a regular polygon in the plane. The 1st barycentric subdivision of $P$ is the following triangulation of $P$. Its $0$-skeleton contains the original vertex set of $P$, plus some additional vertices, namely the midpoint $M_E$ of each edge of $P$ and the center $C$ of $P$. Its $1$-skeleton has two edges obtained from each edge $E$ by subdividing it at the point $M_E$, plus some additional edges, namely $CV$ for each vertex $V$ of $P$, and $CM_E$ for each edge of $E$. And now, as expected, the 2nd barycentric subdivision of $P$ is the 1st barycentric subdivision of its 1st barycentric subdivision.






              share|cite|improve this answer









              $endgroup$















                2












                2








                2





                $begingroup$

                There is a simple answer to your question which ignores all of your remarks about handles and crosscaps. Starting from the polygon $P$, first form the 2nd barycentric subdivision of $P$, and then glue the sides of $P$. After gluing, the 2nd barycentric subdivision of $P$ becomes a triangulation of the surface.



                You may wonder: one knows what the 2nd barycentric subdivision of a triangulation is, but what is the 2nd barycentric subdivision of the polygon $P$? Let me assume for simplicity that $P$ is a regular polygon in the plane. The 1st barycentric subdivision of $P$ is the following triangulation of $P$. Its $0$-skeleton contains the original vertex set of $P$, plus some additional vertices, namely the midpoint $M_E$ of each edge of $P$ and the center $C$ of $P$. Its $1$-skeleton has two edges obtained from each edge $E$ by subdividing it at the point $M_E$, plus some additional edges, namely $CV$ for each vertex $V$ of $P$, and $CM_E$ for each edge of $E$. And now, as expected, the 2nd barycentric subdivision of $P$ is the 1st barycentric subdivision of its 1st barycentric subdivision.






                share|cite|improve this answer









                $endgroup$



                There is a simple answer to your question which ignores all of your remarks about handles and crosscaps. Starting from the polygon $P$, first form the 2nd barycentric subdivision of $P$, and then glue the sides of $P$. After gluing, the 2nd barycentric subdivision of $P$ becomes a triangulation of the surface.



                You may wonder: one knows what the 2nd barycentric subdivision of a triangulation is, but what is the 2nd barycentric subdivision of the polygon $P$? Let me assume for simplicity that $P$ is a regular polygon in the plane. The 1st barycentric subdivision of $P$ is the following triangulation of $P$. Its $0$-skeleton contains the original vertex set of $P$, plus some additional vertices, namely the midpoint $M_E$ of each edge of $P$ and the center $C$ of $P$. Its $1$-skeleton has two edges obtained from each edge $E$ by subdividing it at the point $M_E$, plus some additional edges, namely $CV$ for each vertex $V$ of $P$, and $CM_E$ for each edge of $E$. And now, as expected, the 2nd barycentric subdivision of $P$ is the 1st barycentric subdivision of its 1st barycentric subdivision.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 26 at 18:56









                Lee MosherLee Mosher

                52.4k33891




                52.4k33891



























                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid


                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.

                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3163478%2fsystematic-approach-to-triangulation-closed-combinatorial-surfaces%23new-answer', 'question_page');

                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

                    random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

                    Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye