Finding the faces of a shape from coordinates

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












I have shapes, both regular and irregular that are defined by a set of 3D xyz coordinates i.e. 100 coordinates that define a cube. Some of there coordinates make up the faces of the cube and some of the coordinates are within the cube.



I want to know whether there is some form of algorithm or formula that can analyse the coordinates and determine which of the coordinates make up the faces of the cube?



Thanks for the help in advance.




geometry coordinate-systems




share|cite|improve this question






















  • A convex hull algorithm?
    – Jaap Scherphuis
    Aug 16 at 9:23










  • Is there any guarantee that your set of coordinates includes points from the sides and corners? If not, the cube won't be unique. Just think of four points in the plane that form a quadrilateral. You could wrap them with other quadrilaterals. In the result, the coordinates would not longer be corners of the quadrilateral. On the other hand, if you know that all corner-points are part of your coordinate set, then any convex hull algorithm will yield the faces.
    – Babelfish
    Aug 16 at 9:24











  • Yes, some of the points will be in the faces of the faces. The convex hull algorithm looks promising though.
    – user584683
    Aug 16 at 9:30















up vote
0
down vote

favorite












I have shapes, both regular and irregular that are defined by a set of 3D xyz coordinates i.e. 100 coordinates that define a cube. Some of there coordinates make up the faces of the cube and some of the coordinates are within the cube.



I want to know whether there is some form of algorithm or formula that can analyse the coordinates and determine which of the coordinates make up the faces of the cube?



Thanks for the help in advance.




geometry coordinate-systems




share|cite|improve this question






















  • A convex hull algorithm?
    – Jaap Scherphuis
    Aug 16 at 9:23










  • Is there any guarantee that your set of coordinates includes points from the sides and corners? If not, the cube won't be unique. Just think of four points in the plane that form a quadrilateral. You could wrap them with other quadrilaterals. In the result, the coordinates would not longer be corners of the quadrilateral. On the other hand, if you know that all corner-points are part of your coordinate set, then any convex hull algorithm will yield the faces.
    – Babelfish
    Aug 16 at 9:24











  • Yes, some of the points will be in the faces of the faces. The convex hull algorithm looks promising though.
    – user584683
    Aug 16 at 9:30













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have shapes, both regular and irregular that are defined by a set of 3D xyz coordinates i.e. 100 coordinates that define a cube. Some of there coordinates make up the faces of the cube and some of the coordinates are within the cube.



I want to know whether there is some form of algorithm or formula that can analyse the coordinates and determine which of the coordinates make up the faces of the cube?



Thanks for the help in advance.




geometry coordinate-systems




share|cite|improve this question














I have shapes, both regular and irregular that are defined by a set of 3D xyz coordinates i.e. 100 coordinates that define a cube. Some of there coordinates make up the faces of the cube and some of the coordinates are within the cube.



I want to know whether there is some form of algorithm or formula that can analyse the coordinates and determine which of the coordinates make up the faces of the cube?



Thanks for the help in advance.





geometry coordinate-systems





share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 16 at 9:52

























asked Aug 16 at 9:18







user584683


















  • A convex hull algorithm?
    – Jaap Scherphuis
    Aug 16 at 9:23










  • Is there any guarantee that your set of coordinates includes points from the sides and corners? If not, the cube won't be unique. Just think of four points in the plane that form a quadrilateral. You could wrap them with other quadrilaterals. In the result, the coordinates would not longer be corners of the quadrilateral. On the other hand, if you know that all corner-points are part of your coordinate set, then any convex hull algorithm will yield the faces.
    – Babelfish
    Aug 16 at 9:24











  • Yes, some of the points will be in the faces of the faces. The convex hull algorithm looks promising though.
    – user584683
    Aug 16 at 9:30

















  • A convex hull algorithm?
    – Jaap Scherphuis
    Aug 16 at 9:23










  • Is there any guarantee that your set of coordinates includes points from the sides and corners? If not, the cube won't be unique. Just think of four points in the plane that form a quadrilateral. You could wrap them with other quadrilaterals. In the result, the coordinates would not longer be corners of the quadrilateral. On the other hand, if you know that all corner-points are part of your coordinate set, then any convex hull algorithm will yield the faces.
    – Babelfish
    Aug 16 at 9:24











  • Yes, some of the points will be in the faces of the faces. The convex hull algorithm looks promising though.
    – user584683
    Aug 16 at 9:30
















A convex hull algorithm?
– Jaap Scherphuis
Aug 16 at 9:23




A convex hull algorithm?
– Jaap Scherphuis
Aug 16 at 9:23












Is there any guarantee that your set of coordinates includes points from the sides and corners? If not, the cube won't be unique. Just think of four points in the plane that form a quadrilateral. You could wrap them with other quadrilaterals. In the result, the coordinates would not longer be corners of the quadrilateral. On the other hand, if you know that all corner-points are part of your coordinate set, then any convex hull algorithm will yield the faces.
– Babelfish
Aug 16 at 9:24





Is there any guarantee that your set of coordinates includes points from the sides and corners? If not, the cube won't be unique. Just think of four points in the plane that form a quadrilateral. You could wrap them with other quadrilaterals. In the result, the coordinates would not longer be corners of the quadrilateral. On the other hand, if you know that all corner-points are part of your coordinate set, then any convex hull algorithm will yield the faces.
– Babelfish
Aug 16 at 9:24













Yes, some of the points will be in the faces of the faces. The convex hull algorithm looks promising though.
– user584683
Aug 16 at 9:30





Yes, some of the points will be in the faces of the faces. The convex hull algorithm looks promising though.
– user584683
Aug 16 at 9:30











1 Answer
1






active

oldest

votes

















up vote
1
down vote













It is very important to know, whether the set of coordinates (let's call it $C$) really contains corner-vertices. If not, the cube won't be unique (but you could search for a cube with minimal volume or something like that). See those 2D-pictures:
enter image description here



We see two possible "cubes" that realise the coordinates, though the middle picture really realises some coordinates as corners.



If you know that the $C$ contains all corners of the cube you search, then the cube is the convex hull of $C$. There is a well etablished set of algorithms which calculate the convex hull, as Jaap Scherphuis already pointed out.






share|cite|improve this answer






















    Your Answer




    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    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',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    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%2f2884576%2ffinding-the-faces-of-a-shape-from-coordinates%23new-answer', 'question_page');

    );

    Post as a guest
















    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    1
    down vote













    It is very important to know, whether the set of coordinates (let's call it $C$) really contains corner-vertices. If not, the cube won't be unique (but you could search for a cube with minimal volume or something like that). See those 2D-pictures:
    enter image description here



    We see two possible "cubes" that realise the coordinates, though the middle picture really realises some coordinates as corners.



    If you know that the $C$ contains all corners of the cube you search, then the cube is the convex hull of $C$. There is a well etablished set of algorithms which calculate the convex hull, as Jaap Scherphuis already pointed out.






    share|cite|improve this answer


























      up vote
      1
      down vote













      It is very important to know, whether the set of coordinates (let's call it $C$) really contains corner-vertices. If not, the cube won't be unique (but you could search for a cube with minimal volume or something like that). See those 2D-pictures:
      enter image description here



      We see two possible "cubes" that realise the coordinates, though the middle picture really realises some coordinates as corners.



      If you know that the $C$ contains all corners of the cube you search, then the cube is the convex hull of $C$. There is a well etablished set of algorithms which calculate the convex hull, as Jaap Scherphuis already pointed out.






      share|cite|improve this answer
























        up vote
        1
        down vote










        up vote
        1
        down vote









        It is very important to know, whether the set of coordinates (let's call it $C$) really contains corner-vertices. If not, the cube won't be unique (but you could search for a cube with minimal volume or something like that). See those 2D-pictures:
        enter image description here



        We see two possible "cubes" that realise the coordinates, though the middle picture really realises some coordinates as corners.



        If you know that the $C$ contains all corners of the cube you search, then the cube is the convex hull of $C$. There is a well etablished set of algorithms which calculate the convex hull, as Jaap Scherphuis already pointed out.






        share|cite|improve this answer














        It is very important to know, whether the set of coordinates (let's call it $C$) really contains corner-vertices. If not, the cube won't be unique (but you could search for a cube with minimal volume or something like that). See those 2D-pictures:
        enter image description here



        We see two possible "cubes" that realise the coordinates, though the middle picture really realises some coordinates as corners.



        If you know that the $C$ contains all corners of the cube you search, then the cube is the convex hull of $C$. There is a well etablished set of algorithms which calculate the convex hull, as Jaap Scherphuis already pointed out.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Aug 16 at 9:49

























        answered Aug 16 at 9:43









        Babelfish

        647115




        647115






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2884576%2ffinding-the-faces-of-a-shape-from-coordinates%23new-answer', 'question_page');

            );

            Post as a guest
































































            -

            這個網誌中的熱門文章

            How to combine Bézier curves to a surface?

            圖片
            Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite My aim is to smooth the terrain in a video game. Therefore I contrived an algorithm that makes use of Bézier curves of different orders. But this algorithm is defined in a two dimensional space for now. To shift it into the third dimension I need to somehow combine the Bézier curves. Given two curves in each two dimensions, how can I combine them to build a surface? I thought about something like a curve of a curve. Or maybe I could multiply them somehow. How can I combine them to cause the wanted behavior? Is there a common approach? In the image you can see the input, on the left, and the output, on the right, of the algorithm that works in a two dimensional space. For the real application there is a three dimensional input. The algorithm relays only on the adjacent tiles. Given these it will define the control points of the mentioned Bézier cur...
            閱讀完整內容

            Mutual Information Always Non-negative

            圖片
            Clash Royale CLAN TAG #URR8PPP up vote 10 down vote favorite 6 What is the simplest proof that mutual information is always non-negative? i.e., $I(X;Y)ge0$ probability-theory share | cite | improve this question edited Jun 17 '12 at 15:38 Cameron Buie 83.6k 7 71 154 asked Jun 17 '12 at 15:30 Omri 359 3 13 3 Convexity of the function $tmapsto tlog t$. – Did Jun 17 '12 at 15:33 In addition, the convexity properties require the coefficients in the linear combination sum 1. Then, as p(x,y) is a probability distribution, it fullfits such condition. – Francisco Javier Delgado Ceped Aug 10 at 18:44 add a comment  |  up vote 10 down vote favorite 6 What is the simplest proof that mutual information is always non-negative? i.e., $I(X;Y)ge0$ probability-theory share | cite | improve this question edited Jun 17 ...
            閱讀完整內容

            Why am i infinitely getting the same tweet with the Twitter Search API?

            圖片
            up vote 0 down vote favorite My code workes perfectly for other queries, but for one query I am infinitely getting the same tweet. I can't understand what the problem is. API call: query='Allergic asthma OR Nonallergic asthma OR Occupational asthma OR EIB OR Exercise-induced bronchoconstriction OR Nocturnal asthma OR Cough-variant asthma' new_tweets = api.search(q=searchQuery, count=100, since_id=since_id, lang='en',tweet_mode='extended') if not new_tweets: print("No more tweets found") break for tweet in new_tweets: if True: print(jsonpickle.encode(tweet._json, unpicklable=False)) my_file = open('searchTweets.txt','a') my_file.write(jsonpickle.encode(tweet._json, unpicklable=False)+'n') my_file.close() else: continue Output in file: https://pastebin.com/JmRCsTeE These are the JSONs of the same Tweet. Other queries that work: Breast cancer OR Prostate cancer OR Colon cancer OR Lung cancer Type 2 dia...
            閱讀完整內容