Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Near Optimal Isosurface Extraction Algorithm Span Space

    Hochgeladen von

    Parsa Amini
    16 Ansichten15 Seiten
    This document summarizes a paper presentation on a near optimal isosurface extraction algorithm using the span space. The presentation discusses how previous isosurface extraction methods had limitations for large, unstructured datasets. The new algorithm represents data cells in a span space using a k-d tree for compression. It then efficiently finds the subset of cells intersecting the isosurface through neighborhood searches in the tree. This reduces the problem dimensionality and allows local surface approximation within each cell. The algorithm achieves linear time complexity and memory requirements proportional to the number of intersecting cells rather than total cells.

    Originalbeschreibung:

    Near Optimal Isosurface Extraction Algorithm Using the Span Space

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    PPTX, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document summarizes a paper presentation on a near optimal isosurface extraction algorithm using the span space. The presentation discusses how previous isosurface extraction methods had limitations for large, unstructured datasets. The new algorithm represents data cells in a span space using a k-d tree for compression. It then efficiently finds the subset of cells intersecting the isosurface through neighborhood searches in the tree. This reduces the problem dimensionality and allows local surface approximation within each cell. The algorithm achieves linear time complexity and memory requirements proportional to the number of intersecting cells rather than total cells.

    Copyright:

    © All Rights Reserved
    Als PPTX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    16 Ansichten15 Seiten

    Near Optimal Isosurface Extraction Algorithm Span Space

    Hochgeladen von

    Parsa Amini
    This document summarizes a paper presentation on a near optimal isosurface extraction algorithm using the span space. The presentation discusses how previous isosurface extraction methods had limitations for large, unstructured datasets. The new algorithm represents data cells in a span space using a k-d tree for compression. It then efficiently finds the subset of cells intersecting the isosurface through neighborhood searches in the tree. This reduces the problem dimensionality and allows local surface approximation within each cell. The algorithm achieves linear time complexity and memory requirements proportional to the number of intersecting cells rather than total cells.

    Copyright:

    © All Rights Reserved
    Als PPTX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 15

    CSC7443:ScientificInformationVisualization

    PaperPresentation

    CSC7443:ScientificInformationVisualization

    NearOptimalIsosurfaceExtraction
    AlgorithmUsingtheSpanSpace
    Y.Livnat,H.Shen,C.Johnson,IEEETransactions
    onVisualizationandComputerGraphics,1996
    Presentedby

    ParsaAmini
    CSC7443:ScientificInformationVisualization

    Problem

    Isosurface Extraction

    Reveal underlying structures

    Medical imaging

    Numerical approximation techniques

    Finite differences

    Element methods

    Structure/Unstructured data
    Data sets are getting bigger

    Anatomical structures
    Tissues

    Better scanners
    More computation capacity

    Can we do better than existing methods?

    Interactive investigation of data set

    CSC7443:ScientificInformationVisualization

    Idea

    Spanspacerepresentation
    Kdtrees
    Compression

    Triangulation

    CSC7443:ScientificInformationVisualization

    SpanSpace

    If

    isgivenfield
    issamplesetover
    issizeofdataset

    Then

    Forsome
    isgeometricspace
    usassociatedvaluespace

    CSC7443:ScientificInformationVisualization

    IsosurfaceExtractioninSpanSpace

    Ifgiven
    value
    Find
    suchthat
    Sneednotbetopologicallysimple

    CSC7443:ScientificInformationVisualization

    Process

    Localapproximationwithineachcell
    ApproximatingSasaglobalsolutioncanbedifficult
    $dishugeintypicalscience/engineeringdatasets

    Twostages
    locatecellsthatintersecttheisosurface
    locallyapproximatetheisosurfaceinsideeachcell

    CSC7443:ScientificInformationVisualization

    Structuredgrids

    positionofcellcanberepresentedinG
    Doesnotrequireexplicitadjacencyinformation
    betweencells
    Isosurfaceextractionmethodsonstructuredgrids
    conductsearchesoverG

    SearchApproach
    issetofcellsin
    eachcellassociatedwithvalues
    findsubset
    intersectionofvalue

    CSC7443:ScientificInformationVisualization

    Unstructured

    Cellshavenoexplicitorder(position,shape)
    Methodsbefore
    hadadditionalexplicitinformation
    reverttosearchover
    onlyexaminemin/maxofacell
    todetermineifisosurfaceintersectscell
    reducesdimensionalityofproblemtotwo
    forscalarfields

    CSC7443:ScientificInformationVisualization

    Adatacell
    representedbya
    pointbaseduponmin
    andmaxvaluesat
    verticesofcell
    Pointsinyellowarea
    representcellsthat
    intersecttheisovalue

    CSC7443:ScientificInformationVisualization

    Kdtrees

    Linesrepresentkdtree
    structure
    Verticallinerootrepresents
    firstsplitofspanspacealong
    mincoordinate
    Level1:the2horizontallines
    thatsplitthe2majorsub
    regionsalongmaxcoordinate
    Level2:thesplitof4sub
    spacesisalongmin
    coordinateagain
    Continueprocessuntilall
    pointsaccountedfor

    CSC7443:ScientificInformationVisualization

    PointerlessKdtrees

    CSC7443:ScientificInformationVisualization

    Neighborhoodsearch

    nearsearchminmax(pv,v,node){
    if(node.min<pv)
    nearsearchmaxmin(pv,v,node.right);
    elseif(node.min>v){
    nearsearchmaxmin(pv,v,node.left);
    else{
    if(node.max>v)

    addnode;

    nearsearchmaxmin(pv,v,node.right);
    nearsearchmaxmin(pv,v,node.left);
    }

    CSC7443:ScientificInformationVisualization

    Triangulation

    Ordertheverticessuchthatthetriangleswillbeorientedwith

    respecttoisosurface
    Knowninadvance,nocost

    Reorderverticesaccordingtotheirascendingvalues
    Ifintersectingtheisosurface

    Onlycompareatmostthetwomiddlevertices
    Twocases:
    belowthesurfaceandabove
    Or,below,,above

    CSC7443:ScientificInformationVisualization

    Result

    Timecomplexity
    vsforoldermethods

    Memoryrequirement
    isnumberofdatacells
    isnumberofcellsintersectinganisosurface

    CSC7443:ScientificInformationVisualization

    Das könnte Ihnen auch gefallen