GeometryProcessing/Spring2009/Schedule/Surface Generation Extraction1 - Revision history

Cscheid: /* Questions */

2009-01-23T21:30:40Z

Questions

← Older revision		Revision as of 21:30, 23 January 2009
Line 9:		Line 9:
	(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.		(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.

	''Guidance Field''		''Guidance Field - Not sure if this is something we've talked about or are going to talk about, but for an advancing front method to generate iso-surfaces, what's a guidance field? I would assume that it's some sort of function that guides the creation of new triangles, but how? And what's it look like?''

	~~Not sure if this~~ is ~~something~~ we~~'ve talked about or are going to talk about~~, ~~but for an advancing front method to generate iso~~-~~surfaces, what's~~ a ~~guidance field~~? ~~I would assume that it's some sort~~ of ~~function that guides the creation~~ of ~~new triangles~~, ~~but how? And what's it look~~ like?		The guidance field is the function that, for every point in space, tells you how big the triangle can be there. Remember that, in class, we looked at how one particular size constraint for a triangle (say, near a high-curvature region) induced a constraint over the entire space? And then we took the minimum of a lot of constraints, which looked like an upside-down "mountain range"? This is the guidance field.

Loos: /* Questions */

2009-01-22T05:37:40Z

Questions

← Older revision		Revision as of 05:37, 22 January 2009
Line 5:		Line 5:
	=== Questions ===		=== Questions ===

	What steps would take place when using Marching Cubes to extract a surface from an implicit representation?		''What steps would take place when using Marching Cubes to extract a surface from an implicit representation?''

	(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.		(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.

Loos: /* Questions */

2009-01-22T05:37:01Z

Questions

← Older revision		Revision as of 05:37, 22 January 2009
Line 8:		Line 8:

	(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.		(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.

			''Guidance Field''

			Not sure if this is something we've talked about or are going to talk about, but for an advancing front method to generate iso-surfaces, what's a guidance field? I would assume that it's some sort of function that guides the creation of new triangles, but how? And what's it look like?

Cscheid at 20:16, 21 January 2009

2009-01-21T20:16:15Z

← Older revision		Revision as of 20:16, 21 January 2009
Line 1:		Line 1:
	*John Meier		*John Meier
	I liked the structure of Tuesday's lecture: 1) the build-up to the topic of marching cubes from marching tets, and 2) examination of the aspects of marching cubes that have been "solved", like how to prevent ambiguous surface extraction by automatically generating the intersection lookup table, and optimizing runtime with structures likes octrees or span spaces. The biggest mental hurdle for me among the lecture topics was the reason for building an octree of an implicit surface from the bottom up as a preprocessing step, which Carlos cleared up well (once the structure is built, it can be queried for any constant). The analogy to sorting an array before searching for elements was intuitive and appreciated. ~~I have a remaining question due to my lack of experience:~~ What steps would take place when using ~~marching cubes~~ to extract a surface from an implicit representation? (~~i.e.~~, ~~when would the ability~~ to ~~quickly query~~ an ~~octree~~ for ~~multiple values be useful?)~~.		I liked the structure of Tuesday's lecture: 1) the build-up to the topic of marching cubes from marching tets, and 2) examination of the aspects of marching cubes that have been "solved", like how to prevent ambiguous surface extraction by automatically generating the intersection lookup table, and optimizing runtime with structures likes octrees or span spaces. The biggest mental hurdle for me among the lecture topics was the reason for building an octree of an implicit surface from the bottom up as a preprocessing step, which Carlos cleared up well (once the structure is built, it can be queried for any constant). The analogy to sorting an array before searching for elements was intuitive and appreciated.


			=== Questions ===

			What steps would take place when using Marching Cubes to extract a surface from an implicit representation?

			(I'm not sure I understood the question, so feel free to tell me I didn't get it) If you already have a volumetric dataset stored as a 3D set of voxels in space, then you can just run Marching Cubes directly on that representation, one voxel being one cube. If what you have is an evaluation formula for each point in space, then you can first evaluate the function in a fixed volumetric grid, giving you the voxels and then running Marching Cubes.

Jmeier: New page: *John Meier I liked the structure of Tuesday's lecture: 1) the build-up to the topic of marching cubes from marching tets, and 2) examination of the aspects of marching cubes that have bee...

2009-01-21T19:11:56Z

New page: *John Meier I liked the structure of Tuesday's lecture: 1) the build-up to the topic of marching cubes from marching tets, and 2) examination of the aspects of marching cubes that have bee...

New page

*John Meier
I liked the structure of Tuesday's lecture: 1) the build-up to the topic of marching cubes from marching tets, and 2) examination of the aspects of marching cubes that have been "solved", like how to prevent ambiguous surface extraction by automatically generating the intersection lookup table, and optimizing runtime with structures likes octrees or span spaces. The biggest mental hurdle for me among the lecture topics was the reason for building an octree of an implicit surface from the bottom up as a preprocessing step, which Carlos cleared up well (once the structure is built, it can be queried for any constant). The analogy to sorting an array before searching for elements was intuitive and appreciated. I have a remaining question due to my lack of experience: What steps would take place when using marching cubes to extract a surface from an implicit representation? (i.e., when would the ability to quickly query an octree for multiple values be useful?).