A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Profile minimization on triangulated triangles
2003
Discrete Mathematics
Preserved Fulltext
Given graph G = (V; E) on n vertices, the proÿle minimization problem is to ÿnd a one-to-one function f : V → {1; 2; : : The trangulated triangle T l is the graph whose vertices are the triples of non-negative ...
This paper provides a polynomial time algorithm to solve the proÿle minimization problem for trangulated triangles T l with side-length l. ...
The triangulated triangle T l is the graph whose vertices are the triples of nonnegative integers summing to l, with an edge connecting two triples if they agree in one coordinate and di er by 1 in the ...
doi:10.1016/s0012-365x(02)00450-8
fatcat:jirxyvoyazc5xpsdebuikxsmqi
Adaptive Surface Triangulations for 3D Process Simulation
[chapter]
2004
Simulation of Semiconductor Processes and Devices 2004
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an enhanced smoothing algorithm in order to minimize the number of nodes in a surface triangulation while at the same time the wafer topography is maintained, and changes of geometry are limited ...
The use of local and material-dependent smoothing tolerance is mandatory for the optimization of surface triangulations. ...
if one assumes that each node and edge of the surface triangulation must also be part of the volume mesh. ...
doi:10.1007/978-3-7091-0624-2_38
fatcat:7phyqcieobefhpa6mrrch2jp2q
Triangulation: a technique for maintaining perioperative symmetry in aesthetic breast surgery
2007
European journal of plastic surgery
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
, there are no recommendations in the literature mainly focusing on how to maintain the symmetry perioperatively other than operating while the patient is in semisitting position. ...
There are multiple studies in all aspects of aesthetic breast surgery focusing on the preoperative markings and technical details of the procedures to achieve the ideal breast shape; however, to our knowledge ...
This potential complication may be minimized by placing the sutures one finger breadth above the sternum, and one finger breadth below the xyfoid, where the skin is relatively thinner. ...
doi:10.1007/s00238-007-0148-4
fatcat:ztuza6fkc5hrnfmbayf7xweepm
Simplification des cartes géographiques par minimisation de la déformation locale
2002
Comptes rendus. Mathematique
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In general, in this kind of application, the geometric model (a terrain, for instance) is represented by a triangulation or a grid that may contain several millions triangles or quadrilaterals. ...
In this Note, we propose a new simplification method based on a measure of the local deformation of the surface. ...
a simplified triangulation T s based on a 'minimal' subset V of the vertices of T in which the 'distance' to the map T is less than or equal to a given threshold value. ...
doi:10.1016/s1631-073x(02)02250-1
fatcat:yz2bqta5ojbspmgwrylzjqedje
Finding optimal triangulation based on block method
2014
Southeast Europe Journal of Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we give one new proposal in finding optimal triangulation which is based on our authorial method for generating triangulation (Block method). ...
The main goal of this paper is on the speed of obtaining optimal triangulation. ...
Many authors deals with the problem how to find the optimum triangulation of a convex polygon based on some criterion, eg a triangulation which minimizes the perimeters of the component triangles ( value ...
doi:10.21533/scjournal.v3i2.3
fatcat:unxrjymmyfd6hph5enqyd7j4jy
Meshing for velocity modeling and ray tracing in complex velocity fields
2006
Geophysics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
To minimize traveltime errors, mesh element size varies according to local velocity complexity. ...
Using finely sampled velocity grids as references, we show that meshes can represent both smooth and discontinuous velocity profiles accurately and with less computer memory than grids. ...
FIG. 4 : 4 Slowness profiles along a triangle edge. The exact slowness curve with a discontinuity at the center of the edge is given in black. ...
doi:10.1190/1.2159061
fatcat:uqpifh4nanc75nq2flrkaxjoay
Scattered data interpolation with nonnegative preservation using bivariate splines and its application
2015
Computer Aided Geometric Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We establish the existence and uniqueness of the minimizer under mild assumptions on the data locations and triangulations. Next we show some approximation properties of the minimizer. ...
We then use the classic projected gradient algorithm to find the minimizer using a simplified nonnegative constraint. ...
Fig. 8 . 8 Minimal energy interpolation and positive preserving interpolation based on triangulation (the left one inFig. 7). ...
doi:10.1016/j.cagd.2015.02.004
fatcat:5pwxfyshu5amdcynr3rwg6k7va
A method to segment a 3D surface point cloud for selective sensing in robotic exploration
2010
2010 IEEE International Workshop on Robotic and Sensors Environments
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The method is demonstrated on actual datasets collected in a laboratory environment. ...
3D data with stereo vision or a laser range finder can be a relatively long process, selective sensing is desired to optimize the amount of data collected to accurately represent the environment in a minimal ...
Delaunay triangulation is initially applied on the raw 3D point cloud to produce a surface profile. ...
doi:10.1109/rose.2010.5675289
dblp:conf/rose/CurtisP10
fatcat:6na5nemkwfcsbacz4msk577fwm
Resampling Feature and Blend Regions in Polygonal Meshes for Surface Anti-Aliasing
2001
Computer graphics forum (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a sampling pattern for feature and blend regions which minimizes these alias errors. ...
The quality of the reconstruction not only depends on the number and density of the sample points but also on their alignment to sharp and rounded features of the original geometry. ...
we showed that a rolling-ball blend should be triangulated based on a sampling pattern that is aligned to the principal curvature directions (trajectories and circle profiles) in order to minimize normal ...
doi:10.1111/1467-8659.00533
fatcat:wweuwd5rwjff3oj4gnufeixzke
Coupling Yang-Mills with Causal Dynamical Triangulations
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We discuss the algorithmic problem of minimal coupling gauge fields of the Yang-Mills type to Quantum Gravity in the approach known as Causal Dynamical Triangulations (CDT) as a step towards studying, ...
We first describe the algorithm for general dimensions and gauge groups and then focus on the results obtained from simulations of 2d CDT coupled to gauge fields with U(1) and SU(2) gauge groups, where ...
Numerical simulations have been performed on the MARCONI machine at CINECA, based on the agreement between INFN and CINECA (under projects INF19_npqcd and INF20_npqcd), and at the IT Center of the Pisa ...
arXiv:2112.03157v2
fatcat:4dumpncyt5fshjsfbtanspaf4i
Locally causal dynamical triangulations in two dimensions
2015
Physical Review D
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We analyze the universal properties of a new two-dimensional quantum gravity model defined in terms of Locally Causal Dynamical Triangulations (LCDT). ...
ensemble, we find numerical evidence that the continuum limit of the model lies in a new universality class of two-dimensional quantum gravity theories, inequivalent to both Euclidean and Causal Dynamical Triangulations ...
For a given triangulation T we therefore end up with a sample of locally minimal loops (locally because they pass through prescribed vertices on the torus). ...
doi:10.1103/physrevd.92.084002
fatcat:3r7ur47jg5ahrhj44gg5dsipfe
Euclidian 4d quantum gravity with a non-trivial measure term
2013
Journal of High Energy Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We explore an extended coupling constant space of 4d regularized Euclidean quantum gravity, defined via the formalism of dynamical triangulations. ...
As a consequence we cannot attribute any continuum physics interpretation to the so-called crinkled phase of 4d dynamical triangulations. ...
The difference amounted to placing the gauge fields on the triangles of the 4d triangulation or placing them on the so-called dual triangles. ...
doi:10.1007/jhep10(2013)100
fatcat:i5utn3dq7vcyxpzt4p6wtpbxfe
Statistical analysis of shape through triangulation of landmarks: A study of sexual dimorphism in hominids
1998
Proceedings of the National Academy of Sciences of the United States of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the present paper, the corresponding statistical methodology is developed by triangulation of the landmarks and by considering the angles as natural measurements of shape. ...
Two objects with homologous landmarks are said to be of the same shape if the configuration of landmarks of one object can be exactly matched with that of the other by translation, rotation͞ref lection ...
Angular Measurements of Profile Between Landmarks Although the angular data based on any particular triangulation of landmarks specify the configuration of landmarks, some further data may be generated ...
doi:10.1073/pnas.95.8.4121
pmid:9539700
pmcid:PMC22452
fatcat:kvwnoi7p4rccjjhzntq2dghxnm
Single viewpoint model completion of symmetric objects for digital inspection
2011
Computer Vision and Image Understanding
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
He has served on numerous program committees, on several NSF panels, as journal editor, as conference and paper chair, and authored over 60 papers. ...
In our work, three problems of previous approaches to generating complete models are avoided or minimized: 1) we avoid 3D triangulation, 2) we avoid searches for geometry to extend our models, and 3) we ...
Theoretically, three point samples are adequate to define a point on each profile curve. ...
doi:10.1016/j.cviu.2010.11.019
fatcat:u65bnlcyvzc5bcvamrvldi6ioy
SpineJ: A software tool for quantitative analysis of nanoscale spine morphology
[article]
2019
bioRxiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Polygon-based skeleton generation Triangles of the constrained Delaunay triangulation are divided into three categories ( Supplementary Fig. 3A ) : extremal (E, one neighboring triangle), transitional ...
(D) Constrained Delaunay triangulation computed on the vectorial outline (red). ...
doi:10.1101/764548
fatcat:ikmbk6jgrnfg7argduvaequnui
« Previous
Showing results 1 — 15 out of 8,451 results