2980 search results - page 124 / 596 » Computational Geometry |
107
click to vote
IMR
2003
Springer
15 years 3 months ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
101
click to vote
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
COCOA
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
PR
2008
2008
Computation of a face attractiveness index based on neoclassical canons, symmetry, and golden ratios
14 years 10 months ago
Analysis of attractiveness of faces has long been a topic of research. Literature has identified many different factors that can be related to attractiveness. In this research we ...
IMR
2004
Springer
15 years 3 months ago
2004
Springer
We compare inexact Newton and coordinate descent methods for optimizing the quality of a mesh by repositioning the vertices, where quality is measured by the harmonic mean of the ...