147,808 Hits in 2.8 sec

Boundary First Flattening

Rohan Sawhney, Keenan Crane
2017 ACM Transactions on Graphics  
Boundary first flattening (BFF) is a linear method for conformal parameterization which is faster than traditional linear methods, yet provides control and quality comparable to sophisticated nonlinear  ...  Since computation demands only a single factorization of the real Laplace matrix, the amortized cost is about 50x less than any previously published technique for boundary-controlled conformal flattening  ...  First, to prescribe exterior anglesκ we simply add linear constraints β jk i = π −κ i at each boundary vertex i.  ... 
doi:10.1145/3132705 fatcat:3rweezit3jgwjpyfo56aqeskyi

Geophysical model of the dynamical flattening of the Earth in agreement with the precession constant

P. Defraigne
1997 Geophysical Journal International  
First, we compute mantle circulation associated with the density anomalies derived from a tomography model.  ...  observed by tomography and (2) internal boundary topographies.  ...  We first computed the non-hydrostatic boundary deformations induced by mantle flows associated with lateral density heterogeneities.  ... 
doi:10.1111/j.1365-246x.1997.tb00986.x fatcat:3xdfiu4bwncn3hfjwdo35tcskq

Reduce the stretch in surface flattening by finding cutting paths to the surface boundary

Charlie C.L. Wang, Yu Wang, Kai Tang, Matthew M.F. Yuen
2004 Computer-Aided Design  
First, a linear algorithm for computing an approximate boundary geodesic distance map is introduced; the map encapsulates the undirected geodesic distance from every triangular node to the surface boundary  ...  This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface.  ...  After that, we add the newly generated path into the surface boundary, and go back to the first step to compute the new boundary geodesic distance map.  ... 
doi:10.1016/s0010-4485(03)00024-1 fatcat:zd3jqcwsxvaa3mqnxqayv3al2q

Automated image segmentation-assisted flattening of atomic force microscopy images

Yuliang Wang, Tongda Lu, Xiaolai Li, Huimin Wang
2018 Beilstein Journal of Nanotechnology  
In the first step, the convex and concave features in the foreground were automatically segmented with accurate boundary detection. The extracted foreground features were taken as exclusion masks.  ...  As a result, image flattening is required prior to image analysis.  ...  Results and Discussion In this section, a comparison of different flattening methods was first conducted.  ... 
doi:10.3762/bjnano.9.91 pmid:29719750 pmcid:PMC5905267 fatcat:i62372gsonbjhaapqszcd62aqe

Flattening maps for the visualization of multibranched vessels

Lei Zhu, S. Haker, A. Tannenbaum
2005 IEEE Transactions on Medical Imaging  
The first approach is a conformal mapping algorithm based on the minimization of two Dirichlet functionals.  ...  In this paper, we present two novel algorithms which produce flattened visualizations of branched physiological surfaces, such as vessels.  ...  In the first step, the boundary values are decided by triangle counts between the root and the other boundaries. This is a very coarse estimation.  ... 
doi:10.1109/tmi.2004.839368 pmid:15707245 pmcid:PMC3640433 fatcat:ch7i4wzhcnepzp3475lcegslgy

Placental Flattening via Volumetric Parameterization [article]

S. Mazdak Abulnaga, Esra Abaci Turk, Mikhail Bessmeltsev, P. Ellen Grant, Justin Solomon, Polina Golland
2019 arXiv   pre-print
We achieve sub-voxel accuracy in mapping the boundary of the placenta to the template while successfully controlling distortion throughout the volume.  ...  Our code is freely available at .  ...  We first assign to the rim all vertices on the boundary of the two clusters, i.e., those with neighbors in the other cluster.  ... 
arXiv:1903.05044v3 fatcat:bd5vmsblpndtdjkhgnejvstho4

Contribution of CRUST2.0 components to the tri-axiality of the Earth and equatorial flattening of the core

Sun Rong, Shen Wenbin
2013 Geodesy and Geodynamics  
Mter the contribution of density contrast is stripped, the equatorial flattening of the core was found to be 6. 544 x 10-5 , which is still one order of magnitude smaller than the result given by the first  ...  For boundaries of other layers, we used values from the CRUST2. 0 model with a resolution of 2 o.  ...  If the density of the tri-axial ellipsoid is constant, From equation ( 26) we see that e; appears in {3 as second-order terms of flattening, whereas e~ appears as first order of dynamical flattening  ... 
doi:10.3724/sp.j.1246.2013.03053 fatcat:uvxy7syj75hhxct4rjz77ukkmi

Optimal fitting of strain-controlled flattenable mesh surfaces

Yunbo Zhang, Charlie C. L. Wang, Karthik Ramani
2016 The International Journal of Advanced Manufacturing Technology  
First, we introduce a new surface modeling method to conduct a sequence of nearly isometric deformations to morph a flattenable mesh surface to a new shape which has a better approximation of the input  ...  Last, to improve the scalability of our optimal surface fitting algorithm, a coarseto-fine fitting framework is exploited so that very dense flattenable mesh surfaces can be modeled and boundaries of the  ...  First, a new surface modeling method is conduct a sequence of nearly isodeformations to morph a flattenable mesh surface to a new shape which has a better approximation of the input surface.  ... 
doi:10.1007/s00170-016-8669-2 fatcat:6mbhlo3d3vfgdamg2x32gfqrvi

A New Approach to Crushing 3-Manifold Triangulations

Benjamin A. Burton
2014 Discrete & Computational Geometry  
When the crushing operation was first introduced, the analysis was powerful but extremely complex.  ...  The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-manifold topology: it enabled the first practical implementations of 3-sphere recognition and prime decomposition  ...  flatten both boundary bigons without problems.  ... 
doi:10.1007/s00454-014-9572-y fatcat:pkwulabrtzfovecbq2zquk5544

Quasi-Conformally Flat Mapping the Human Cerebellum [chapter]

Monica K. Hurdal, Philip L. Bowers, Ken Stephenson, De Witt L. Sumners, Kelly Rehm, Kirt Schaper, David A. Rottenberg
1999 Lecture Notes in Computer Science  
) information under flattening.  ...  Our approach attempts to preserve the conformal structure between the original cortical surface in 3-space and the flattened surface.  ...  First, it is completely canonical, meaning that such flattenings are uniquely determined once certain standard normalizations have been chosen.  ... 
doi:10.1007/10704282_31 fatcat:tngmkahqlnhbjbvan4vqbgfvpu

Improving Initial Flattening of Convex-Shaped Free-Form Mesh Surface Patches Using a Dynamic Virtual Boundary

Erdem Yavuz, Rıfat Yazıcı, Mustafa Cem Kasapba¸sı, Turgay Tugay Bilgin
2019 Computer systems science and engineering  
This study proposes an efficient algorithm for improving flattening result of triangular mesh surface patches having a convex shape.  ...  The dynamic virtual boundary approach is utilized to reduce the distortions for the triangles near the boundary caused by the nature of convex combination technique.  ...  hybrid flattening, which is a combination of the first two [9] .  ... 
doi:10.32604/csse.2019.34.339 fatcat:ukcd5zo74fev7iztjkbz5x465q

Density-Equalizing Maps for Simply Connected Open Surfaces

Gary P. T. Choi, Chris H. Rycroft
2018 SIAM Journal of Imaging Sciences  
In this paper, we are concerned with the problem of creating flattening maps of simply connected open surfaces in \BbbR 3 .  ...  By varying the initial density distribution, a large variety of flattening maps with different properties can be achieved.  ...  first flattening [38] .  ... 
doi:10.1137/17m1124796 fatcat:ihvgreuztrguvl74f66kav5uny

Freeform surface flattening based on fitting a woven mesh model

Charlie C.L. Wang, Kai Tang, Benjamin M.L. Yeung
2005 Computer-Aided Design  
We will first review some related work in surface flattening. The woven mesh model is then introduced.  ...  The freeform 3D surface considered in this paper is represented as a two-manifold polygonal mesh with a boundary, which is topologically equivalent to a disk.  ...  Their algorithm first obtains an approximate planar shape by flattening the triangles on the surface, cracks are generated while triangles are flattened one by one; and then, they reorient cracks and overlap  ... 
doi:10.1016/j.cad.2004.09.009 fatcat:xbykvohwnjezphh3l3tcph3ena

Real-Time Automatic Segmentation of Optical Coherence Tomography Volume Data of the Macular Region

Jing Tian, Boglárka Varga, Gábor Márk Somfai, Wen-Hsiang Lee, William E. Smiddy, Delia Cabrera DeBuc, Daniel L Rubin
2015 PLoS ONE  
The proposed method is implemented using the shortestpath based graph search, which detects the retinal boundaries by searching the shortest-path between two end nodes using Dijkstra's algorithm.  ...  Additional techniques, such as inter-frame flattening, inter-frame search region refinement, masking and biasing were introduced to exploit the spatial dependency between adjacent frames for the reduction  ...  Particularly, in order to detect each boundary, flattening is first performed to reduce the curvature of the target boundary.  ... 
doi:10.1371/journal.pone.0133908 pmid:26258430 pmcid:PMC4530974 fatcat:yxyymscuyvdf5khui2l2hux6na

Conformal flattening maps for the visualization of vessels

Lei Zhu, Steven Haker, Allen R. Tannenbaum, Seong K. Mun
2002 Medical Imaging 2002: Visualization, Image-Guided Procedures, and Display  
In this note, we employ a conformal mapping technique for flattening branching tubular structures for visualization of MRA and CT volumetric vessel imagery.  ...  Our method is based on a discretization of the Laplace-Beltrami operator to flatten a surface onto a planar polygonal region in an angle-preserving manner.  ...  First, using the segmentation method in Ref. 3 and Ref. 7, we found the surface of a section of vessel.  ... 
doi:10.1117/12.466985 dblp:conf/miigp/ZhuHT02 fatcat:76w2keflmveprgzpyk4goiarfq
« Previous Showing results 1 — 15 out of 147,808 results