Marching Square

dc.contributor.authorHanisch, Franken_US
dc.contributor.editor-en_US
dc.date.accessioned2015-12-10T13:43:23Z
dc.date.available2015-12-10T13:43:23Z
dc.date.issued6-8-2004en_US
dc.description.abstractThis interactive CGEM illustrates the marching squares algorithm, a 2D isoline representation technique commonly used for contouring. Teachers may also use this CGEM to introduce the 3D marching cubes algorithm, which uses the same approach [1]. Users can directly manipulate two circle objects. The shape of the objects is considered unknown. After sampling the objects on a regular grid, the marching squares algorithm approximates the contour. Users may move the circles to adjacent locations to experience how we resolve ambiguous cases by an additional midpoint test.en_US
dc.description.sectionheadersModulesen_US
dc.description.seriesinformationCGEMS - Computer Graphics Educational Materialsen_US
dc.identifier.doi10.2312/cgems04-11-1369en_US
dc.identifier.issn-en_US
dc.identifier.pagesFrank Hanisch-Curves and surfaces, Scientific visualization, Algorithmic, Application Domains, Modeling Techniques, Software, Technologyen_US
dc.identifier.urihttps://doi.org/10.2312/cgems04-11-1369en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCurves and surfacesen_US
dc.subjectScientific visualizationen_US
dc.subjectAlgorithmicen_US
dc.subjectApplication Domainsen_US
dc.subjectModeling Techniquesen_US
dc.subjectSoftwareen_US
dc.subjectTechnologyen_US
dc.titleMarching Squareen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
2003-CGEMS-Hanisch.doc
Size:
77 KB
Format:
Microsoft Word
No Thumbnail Available
Name:
marchingsquare_09-06-2004_165035.zip
Size:
267.95 KB
Format:
Zip file