نتایج جستجو برای: polygonal

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

2008
Sergey Bereg Kevin Buchin Maike Buchin Marina L. Gavrilova Binhai Zhu

Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous (continuous/discrete) Fréchet distance. In this paper, for the first time, we consider the Voronoi diagram of polygonal chains in d-dimension under the discrete Fréchet distance. Given a ...

2014
Jian Wu Chang Zhang Haiguo Qiao

To explore the histogenesis of cuboidal and polygonal tumor cells in the sclerosing hemangioma of lung (SHL), eighteen cases of SHL were retrospectively studied. SPB, p40, TTF-1,EMA,CKpan, vimentin,SMA, CgA,Syn and CD34 were immunohistochemically labeled by the EnVisionmethod. It was found that the four main types of structure in SHL were solid,papillary, hemorrhagic and sclerotic patterns. The...

Journal: :Computers & Graphics 2002
Sang C. Park Hayong Shin

In order to find all intersections among polygonal chains, this paper presents a procedure consisting of two phases: (1) splitting polygonal chains into a minimal number of monotone chains and (2) finding intersections among the monotone chains. For the first phase, we suggest an optimal algorithm splitting polygonal chains into a minimal number of monotone chains, with an Oðn þ r log rÞ time c...

Journal: :Comput. Geom. 2008
Robert L. Scot Drysdale Günter Rote Astrid Sturm

We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting tools are usually described with circular arcs and straight line segments. Greedy algorithms for approximating a polygonal curve with curves of higher order can be found in the literature. Without theoretical bounds it ...

Journal: :Computer-Aided Design 2011
Oleg Fryazinov Alexander A. Pasko Valery Adzhiev

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary; no extra zero-value isosurfaces should be generated; C continuity of the function in the entire domain. T...

2014
STEPHANE DUROCHER ALEXANDRE LEBLANC JASON MORRISON MATTHEW SKALA

In this paper we present a novel nonparametric method for simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. Specifically, given a sequence P of n points in the plane that determine a simple polygonal chain consisting of n− 1 segments, we describe algorithms for selecting a subsequence Q ⊂ P (including th...

Journal: :Computational Geometry 2001

Journal: :Journal of Mathematical Analysis and Applications 1975

Journal: :Proceedings of the American Mathematical Society 1974

Journal: :MATEC Web of Conferences 2019

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

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