2007
DOI: 10.1007/978-3-540-75755-9_30
|View full text |Cite
|
Sign up to set email alerts
|

Multi-level μ-Finite Element Analysis for Human Bone Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 13 publications
0
10
0
Order By: Relevance
“…For planar graphs a PTAS [2] has been found, while for trees an optimum solution can be computed in O(n 2 ) time [6,7]. Our motivation to study the bisection problem comes from the need to parallelise a finite element computation of a human bone structure model in order to diagnose osteoporosis [1]. In such an application the aim is to distribute the data, modelled by the vertices (of a graph G), evenly onto a given number p corresponding closed curve of one of them both contains points belonging to the interior and to the exterior area into which the other cycle divides the plane.…”
Section: Comparing Optimal With Restricted Cutsmentioning
confidence: 99%
See 1 more Smart Citation
“…For planar graphs a PTAS [2] has been found, while for trees an optimum solution can be computed in O(n 2 ) time [6,7]. Our motivation to study the bisection problem comes from the need to parallelise a finite element computation of a human bone structure model in order to diagnose osteoporosis [1]. In such an application the aim is to distribute the data, modelled by the vertices (of a graph G), evenly onto a given number p corresponding closed curve of one of them both contains points belonging to the interior and to the exterior area into which the other cycle divides the plane.…”
Section: Comparing Optimal With Restricted Cutsmentioning
confidence: 99%
“…if β denotes its boundary then β ∩ P = ∅. If β only contains orthogonal lines 1 We will use calligraphic capital letters to denote areas in the plane such as polygons or 3 we refer to P as orthogonal. We call P simple if any two points in P lie on a closed curve in P which can be shrunk to a point without leaving P.…”
Section: Comparing Optimal With Restricted Cutsmentioning
confidence: 99%
“…Such models can be solved using dedicated numerical packages, especially designed for this kind of model. Compared to commercial FE solvers, such solvers typically are restricted to many simplifications regarding the models, but in return allow analyzing geometrically highly detailed models (Arbenz et al, 2007).…”
Section: Bone and Implant Geometrymentioning
confidence: 99%
“…Systems of up to hundreds of millions of degrees of freedom have been solved on large scale computers within a couple of minutes [1,2,3].…”
Section: Introductionmentioning
confidence: 99%