Academic literature on the topic 'Polygonal chain simplification'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Polygonal chain simplification.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Polygonal chain simplification"

1

DUROCHER, STEPHANE, ALEXANDRE LEBLANC, JASON MORRISON, and MATTHEW SKALA. "ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS." International Journal of Computational Geometry & Applications 23, no. 06 (December 2013): 427–41. http://dx.doi.org/10.1142/s021819591360011x.

Full text
Abstract:
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 the first and last points of P) that determines a second polygonal chain to approximate P, such that the number of crossings between the two polygonal chains is maximized, and the cardinality of Q is minimized among all such maximizing subsets of P. Our algorithms have respective running times O(n2 log n) (respectively, [Formula: see text]) when P is monotonic and O(n2 log2 n) (respectively, [Formula: see text]) when P is any simple polygonal chain in the Real RAM model (respectively, in the Word RAM model).
APA, Harvard, Vancouver, ISO, and other styles
2

Buzer, Lilian. "Optimal simplification of polygonal chains for subpixel-accurate rendering." Computational Geometry 42, no. 1 (January 2009): 45–59. http://dx.doi.org/10.1016/j.comgeo.2008.03.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jalalian, Athena, Soheil Arastehfar, Ian Gibson, Francis E. H. Tay, and Gabriel Liu. "How Can Biomechanical Multibody Models of Scoliosis Be Accurate in Simulating Spine Movement Behavior While Neglecting the Changes of Spinal Length?" Journal of Biomechanical Engineering 143, no. 8 (May 3, 2021). http://dx.doi.org/10.1115/1.4050636.

Full text
Abstract:
Abstract This paper studies how biomechanical multibody models of scoliosis can neglect the changes of spinal length and yet be accurate in reconstructing spinal columns. As these models with fixed length comprise rigid links interconnected by rotary joints, they resemble polygonal chains that approximate spine curves with a finite number of line segments. In mathematics, using more segments with shorter lengths can result in more accurate curve approximations. This raises the question of whether more accurate spine curve approximations by increasing the number of links/joints can yield more accurate spinal column reconstructions. For this, the accuracy of spine curve approximation was improved consistently by increasing the number of links/joints, and its effects on the accuracy of spinal column reconstruction were assessed. Positive correlation was found between the accuracy of spine reconstruction and curve approximation. It was shown that while increasing the accuracy of curve approximations, the representation of scoliosis concavity and its side-to-side deviations were improved. Moreover, reconstruction errors of the spine regions separated by the inflection vertebrae had minimal impacts on each other. Overall, multibody scoliosis models with fixed spinal lengths can benefit from the extra rotational joints that contribute toward the accuracy of spine curve approximation. The outcome of this study leads to concurrent accuracy improvement and simplification of multibody models; joint-link configurations can be independently defined for the regions separated by the inflection vertebrae, enabling local optimization of the models for higher accuracy without unnecessary added complexity to the whole model.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Polygonal chain simplification"

1

Tejada, Pedro J. "A Computational Geometry Approach to Digital Image Contour Extraction." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/422.

Full text
Abstract:
We present a method for extracting contours from digital images, using techniques from computational geometry. Our approach is different from traditional pixel-based methods in image processing. Instead of working directly with pixels, we extract a set of oriented feature points from the input digital images, then apply classical geometric techniques, such as clustering, linking, and simplification, to find contours among these points. Experiments on synthetic and natural images show that our method can effectively extract contours, even from images with considerable noise; moreover, the extracted contours have a very compact representation.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Polygonal chain simplification"

1

Zhan, Haisheng, and Guangxin Li. "Progressive Transmission of Vector Map Data Based on Polygonal Chain Simplification." In Advances in Artificial Reality and Tele-Existence, 908–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11941354_94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pohl, Melanie, Jochen Meidow, and Dimitri Bulatov. "Simplification of Polygonal Chains by Enforcing Few Distinctive Edge Directions." In Image Analysis, 3–14. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59129-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Polygonal chain simplification"

1

Buzer, Lilian. "Optimal simplification of polygonal chain for rendering." In the twenty-third annual symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1247069.1247102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography