Thinnest part of a 3D shape formed of tessellations
I have a group of tessellations forming a 3D shape and I need to find the section(s) with least cross section radius in it
Following is the visual aid for understanding this problem:
Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D
Now, Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D.
I wish to find 'C' ie.. set of tessellations with least cross section radii or thinnest part of the given shape.
How do I find it? I was thinking of finding the faces closest to each other but that will fetch the tessellations inside the shape as well.
I have tried:
1. Finding convex hull (Doesnt give points in thinnest area)
2. Alpha shape (No way to find the faces on the surface)
I would appreciate any advise on this matter.
Thanks
math graphics geometry tesselation
asked Nov 12 at 20:44
Pranav Khade
83
add a comment |
I have a group of tessellations forming a 3D shape and I need to find the section(s) with least cross section radius in it
Following is the visual aid for understanding this problem:
Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D
Now, Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D.
I wish to find 'C' ie.. set of tessellations with least cross section radii or thinnest part of the given shape.
How do I find it? I was thinking of finding the faces closest to each other but that will fetch the tessellations inside the shape as well.
I have tried:
1. Finding convex hull (Doesnt give points in thinnest area)
2. Alpha shape (No way to find the faces on the surface)
I would appreciate any advise on this matter.
Thanks
math graphics geometry tesselation
asked Nov 12 at 20:44
Pranav Khade
83
1
You might be looking for the shape diameter function.
– Nico Schertler
Nov 13 at 7:05
Thank you for the reply but it says unknown link. I looked it up on google and trying it out. Will comment here if that works.
– Pranav Khade
Nov 14 at 19:13
Try this link instead. There are multiple follow-up publications about SDF, mostly about how to compute it fast.
– Nico Schertler
Nov 14 at 19:17
add a comment |
I have a group of tessellations forming a 3D shape and I need to find the section(s) with least cross section radius in it
Following is the visual aid for understanding this problem:
Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D
Now, Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D.
I wish to find 'C' ie.. set of tessellations with least cross section radii or thinnest part of the given shape.
How do I find it? I was thinking of finding the faces closest to each other but that will fetch the tessellations inside the shape as well.
I have tried:
1. Finding convex hull (Doesnt give points in thinnest area)
2. Alpha shape (No way to find the faces on the surface)
I would appreciate any advise on this matter.
Thanks
math graphics geometry tesselation
asked Nov 12 at 20:44
Pranav Khade
83
I have a group of tessellations forming a 3D shape and I need to find the section(s) with least cross section radius in it
Following is the visual aid for understanding this problem:
Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D
Now, Assume that each rectangle in the A,B and C is a tessellation and this diagram is 3D.
I wish to find 'C' ie.. set of tessellations with least cross section radii or thinnest part of the given shape.
How do I find it? I was thinking of finding the faces closest to each other but that will fetch the tessellations inside the shape as well.
I have tried:
1. Finding convex hull (Doesnt give points in thinnest area)
2. Alpha shape (No way to find the faces on the surface)
I would appreciate any advise on this matter.
Thanks
math graphics geometry tesselation
math graphics geometry tesselation
asked Nov 12 at 20:44
Pranav Khade
83
asked Nov 12 at 20:44
Pranav Khade
83
asked Nov 12 at 20:44
Pranav Khade
83
asked Nov 12 at 20:44
Pranav Khade
83
asked Nov 12 at 20:44
Pranav Khade
83
83
1
You might be looking for the shape diameter function.
– Nico Schertler
Nov 13 at 7:05
Thank you for the reply but it says unknown link. I looked it up on google and trying it out. Will comment here if that works.
– Pranav Khade
Nov 14 at 19:13
Try this link instead. There are multiple follow-up publications about SDF, mostly about how to compute it fast.
– Nico Schertler
Nov 14 at 19:17
add a comment |
1
You might be looking for the shape diameter function.
– Nico Schertler
Nov 13 at 7:05
Thank you for the reply but it says unknown link. I looked it up on google and trying it out. Will comment here if that works.
– Pranav Khade
Nov 14 at 19:13
Try this link instead. There are multiple follow-up publications about SDF, mostly about how to compute it fast.
– Nico Schertler
Nov 14 at 19:17
1
1
You might be looking for the shape diameter function.
– Nico Schertler
Nov 13 at 7:05
You might be looking for the shape diameter function.
– Nico Schertler
Nov 13 at 7:05
Thank you for the reply but it says unknown link. I looked it up on google and trying it out. Will comment here if that works.
– Pranav Khade
Nov 14 at 19:13
Thank you for the reply but it says unknown link. I looked it up on google and trying it out. Will comment here if that works.
– Pranav Khade
Nov 14 at 19:13
Try this link instead. There are multiple follow-up publications about SDF, mostly about how to compute it fast.
– Nico Schertler
Nov 14 at 19:17
Try this link instead. There are multiple follow-up publications about SDF, mostly about how to compute it fast.
– Nico Schertler
Nov 14 at 19:17
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
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
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53269809%2fthinnest-part-of-a-3d-shape-formed-of-tessellations%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- 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.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53269809%2fthinnest-part-of-a-3d-shape-formed-of-tessellations%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
1
You might be looking for the shape diameter function.
– Nico Schertler
Nov 13 at 7:05
Thank you for the reply but it says unknown link. I looked it up on google and trying it out. Will comment here if that works.
– Pranav Khade
Nov 14 at 19:13
Try this link instead. There are multiple follow-up publications about SDF, mostly about how to compute it fast.
– Nico Schertler
Nov 14 at 19:17