نتایج جستجو برای: convex surface

تعداد نتایج: 687345  

Journal: :Advances in Applied Mathematics 2016

Journal: :Journal of Computational and Applied Mathematics 1994

In this study the effects of machining parameters such as shearing speed, feed rate, tool diameter and machining depth on different milling strategies i.e. 3D offset, spiral, raster and radial to produce the convex surface made of epoxy/glass composites is investigated. The effects of mentioned strategies on output parameters such as surface roughness and milling removal rate is also studied. T...

2006
Diane Souvaine

• Sd: A d-Simplex The simplest convex polytope in R. A d-simplex is always the convex hull of some d + 1 affinely independent points. For example, a line segment is a 1− simplex i.e., the smallest convex subspace which contains two points. A triangle is a 2 − simplex and a tetrahedron is a 3− simplex. • P: A Simplicial Polytope. A polytope where each facet is a d− 1 simplex. By our assumption, ...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

Journal: :communication in combinatorics and optimization 0
m. dettlaff gdańsk university of technology s. kosari azarbaijan shahid madani university m. lemańska gdańsk university of technology s.m. sheikholeslami azarbaijan shahid madani university

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

1999
N. K. LEUNG R. J. RENKA

We describe a detailed computational procedure which, given data values at arbitrarily distributed points in the plane, determines if the data are convex and, if so, constructs a smooth convex surface that interpolates the data. The method consists of constructing a triangulation of the nodes (data abscissae) for which the triangle-based piecewise linear interpolant is convex, computing a set o...

2015
Anne Karelse Steven Leuridan Alexander Van Tongel Philippe Debeer Jos Van Der Sloten Kathleen Denis Lieven F. De Wilde

BACKGROUND The effect of reaming on bone volume and surface area of the glenoid is not precisely known. We hypothesize that (1) convex reamers create a larger surface area than flat reamers, (2) flat reamers cause less bone loss than convex reamers, and (3) the amount of bone loss increases with the amount of version correction. METHODS Reaming procedures with different types of reamers are p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید