Relevant bibliographies by topics / Polygonal number

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Polygonal number'

Author: Grafiati
Published: 7 June 2025
Last updated: 17 July 2025

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 number.'

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 number"

1

Banerjee, Soumyarup, Manav Batavia, Ben Kane, et al. "Fermat's polygonal number theorem for repeated generalized polygonal numbers." Journal of Number Theory 220 (March 2021): 163–81. http://dx.doi.org/10.1016/j.jnt.2020.05.024.

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

Wang, Chao, та Zhongzi Wang. "The limit shapes of midpoint polygons in ℝ3". Journal of Knot Theory and Its Ramifications 28, № 10 (2019): 1950062. http://dx.doi.org/10.1142/s0218216519500627.

Full text
Abstract:
For a polygon in the [Formula: see text]-dimensional Euclidean space, we give two kinds of normalizations of its [Formula: see text]th midpoint polygon by a homothetic transformation and an affine transformation, respectively. As [Formula: see text] goes to infinity, the normalizations will approach “regular” polygons inscribed in an ellipse and a generalized Lissajous curve, respectively, where the curves may be degenerate. The most interesting case is when [Formula: see text], where polygons with all its [Formula: see text]th midpoint polygons knotted are discovered and discussed. Such polyg
APA, Harvard, Vancouver, ISO, and other styles
3

MARTINI, H., and V. SOLTAN. "MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN." International Journal of Computational Geometry & Applications 09, no. 06 (1999): 599–614. http://dx.doi.org/10.1142/s0218195999000340.

Full text
Abstract:
Let [Formula: see text] be a given nonempty family of directions in the plane. For a multiply connected polygonal domain P with polygonal holes, possibly degenerate, we determine the minimum number of convex polygons into which P is partitioned by linear cuts in the directions from [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
4

CHAN, W. S., and F. CHIN. "APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR." International Journal of Computational Geometry & Applications 06, no. 01 (1996): 59–77. http://dx.doi.org/10.1142/s0218195996000058.

Full text
Abstract:
We improve the time complexities for solving the polygonal curve approximation problems formulated by Imai and Iri. The time complexity for approximating any polygonal curve of n vertices with minimum number of line segments can be improved from O(n2 log n) to O(n2). The time complexity for approximating any polygonal curve with minimum error can also be improved from O(n2 log 2n) to O(n2 log n). We further show that if the curve to be approximated forms part of a convex polygon, the two problems can be solved in O(n) and O(n2) time respectively for both open and closed polygonal curves.
APA, Harvard, Vancouver, ISO, and other styles
5

Deguchi, Tetsuo, and Kyoichi Tsurusaki. "A Statistical Study of Random Knotting Using the Vassiliev Invariants." Journal of Knot Theory and Its Ramifications 03, no. 03 (1994): 321–53. http://dx.doi.org/10.1142/s0218216594000241.

Full text
Abstract:
Employing the Vassiliev invariants as tools for determining knot types of polygons in 3 dimensions, we evaluate numerically the knotting probability PK(N) of the Gaussian random polygon being equivalent to a knot type K. For prime knots and composite knots we plot the knotting probability PK(N) against the number N of polygonal nodes. Taking the analogy with the asymptotic scaling behaviors of self-avoiding walks, we propose a formula of fitting curves to the numerical data. The curves fit well the graphs of the knotting probability PK(N) versus N. This agreement suggests to us that the scalin
APA, Harvard, Vancouver, ISO, and other styles
6

Miraj, Md Rahil. "Polygonal Number Triples." Resonance 27, no. 3 (2022): 459–71. http://dx.doi.org/10.1007/s12045-022-1335-0.

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

Kalaivani, Selvakumar and Bimal Kumar Ray. "SURVEY ON POLYGONAL APPROXIMATION TECHNIQUES FOR DIGITAL PLANAR CURVES." International Journal of Information Technology, Modeling and Computing (IJITMC) 1, May (2018): 01–11. https://doi.org/10.5281/zenodo.1422338.

Full text
Abstract:
Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no survey papers on recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and vertices or contour points (ie. polygon). Polygonal approximation is representing the object with less number of dominant points (less number of edges and vertices). Polygon approximation results in less
APA, Harvard, Vancouver, ISO, and other styles
8

RANDELL, RICHARD, JONATHAN SIMON, and JOSHUA TOKLE. "MÖBIUS TRANSFORMATIONS OF POLYGONS AND PARTITIONS OF 3-SPACE." Journal of Knot Theory and Its Ramifications 17, no. 11 (2008): 1401–13. http://dx.doi.org/10.1142/s0218216508006671.

Full text
Abstract:
The image of a polygonal knot K under a spherical inversion of ℝ3 ∪ ∞ is a simple closed curve made of arcs of circles, perhaps some line segments, having the same knot type as the mirror image of K. But suppose we reconnect the vertices of the inverted polygon with straight lines, making a new polygon [Formula: see text]. This may be a different knot type. For example, a certain 7-segment figure-eight knot can be transformed to a figure-eight knot, a trefoil, or an unknot, by selecting different inverting spheres. Which knot types can be obtained from a given original polygon K under this pro
APA, Harvard, Vancouver, ISO, and other styles
9

SIMON, JONATHAN K. "ENERGY FUNCTIONS FOR POLYGONAL KNOTS." Journal of Knot Theory and Its Ramifications 03, no. 03 (1994): 299–320. http://dx.doi.org/10.1142/s021821659400023x.

Full text
Abstract:
We define a scale-invariant energy function for polygonal knots in ℜ3 based on the minimum distances between segments. The energy is bounded below by 2π. (minimum crossing number of the knot type). For each knot type, there exists an ideal number of segments, from which can be made an ideal conformation of the knot having minimum energy among all polygons realizing that knot type. Results leading to this include the following: The energy of an n-segment polygon is greater than n; if energy is bounded then ratios of edge lengths and angles are bounded away from zero; changing knot type requires
APA, Harvard, Vancouver, ISO, and other styles
10

Krushkal, Samuel. "Analytic and geometric quasiinvariants of convex curvelinear polygons with infinite number of vertices." Ukrainian Mathematical Bulletin 20, no. 4 (2023): 557–76. http://dx.doi.org/10.37069/1810-3200-2023-20-4-5.

Full text
Abstract:
Establishing and evaluation of values of the basic curvelinear quasiinvariants of Jordan curves still remains an important problem of geometric and quasiconformal analysis, especially for applications. It is not solved completely even for polygonal domains. The most general known results were established for unbounded polygons with locally smooth boundaries containing the infinite point and having only a finite number of vertices. The present paper deals with convex polygonal domains having infinite (countable) number of vertices. It creates a new approach in this direction and establishes tha
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Polygonal number"

1

Chipatala, Overtone. "Polygonal numbers." Kansas State University, 2016. http://hdl.handle.net/2097/32923.

Full text
Abstract:
Master of Science<br>Department of Mathematics<br>Todd Cochrane<br>Polygonal numbers are nonnegative integers constructed and represented by geometrical arrangements of equally spaced points that form regular polygons. These numbers were originally studied by Pythagoras, with their long history dating from 570 B.C, and are often referred to by the Greek mathematicians. During the ancient period, polygonal numbers were described by units which were expressed by dots or pebbles arranged to form geometrical polygons. In his "Introductio Arithmetica", Nicomachus of Gerasa (c. 100 A.D), thoroughly
APA, Harvard, Vancouver, ISO, and other styles
2

Angeleska, Angela. "Combinatorial models for DNA rearrangements in ciliates." [Tampa, Fla] : University of South Florida, 2009. http://purl.fcla.edu/usf/dc/et/SFE0002998.

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

Carroll, Kathleen Mary. "Determining the number of loops of regular polygons /." Norton, Mass. : Wheaton College, 2010. http://hdl.handle.net/10090/15512.

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

Auger, Joseph Thomas. "Orbits of the Dissected Polygons of the Generalized Catalan Numbers." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1302701692.

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

Ogburn, Julia J. "Roots of Polynomials: Developing p-adic Numbers and Drawing Newton Polygons." Scholarship @ Claremont, 2013. http://scholarship.claremont.edu/scripps_theses/295.

Full text
Abstract:
Newton polygons are constructions over the p-adic numbers used to find information about the roots of a polynomial or power series. In this the- sis, we will first investigate the construction of the field Qp on the p-adic numbers. Then, we will use theorems such as Eisenstein’s Irreducibility Criterion, Newton’s Method, Hensel’s Lemma, and Strassman’s Theorem to build and justify Newton polygons.
APA, Harvard, Vancouver, ISO, and other styles
6

Mott, Brittany Nicole. "Analysis of the Generalized Catalan Orbits." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1302396750.

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

Bureaux, Julien. "Méthodes probabilistes pour l'étude asymptotique des partitions entières et de la géométrie convexe discrète." Thesis, Paris 10, 2015. http://www.theses.fr/2015PA100160/document.

Full text
Abstract:
Cette thèse se compose de plusieurs travaux portant sur l'énumération et le comportement asymptotique de structures combinatoires apparentées aux partitions d'entiers. Un premier travail s'intéresse aux partitions d'entiers bipartites, qui constituent une généralisation bidimensionnelle des partitions d'entiers. Des équivalents du nombre de partitions sont obtenus dans le régime critique où l'un des entiers est de l'ordre du carré de l'autre entier et au delà de ce régime critique. Ceci complète les résultats établis dans les années cinquante par Auluck, Nanda et Wright. Le deuxième travail tr
APA, Harvard, Vancouver, ISO, and other styles
8

Silva, Ronaldo Pires da. "Interseção de números geométricos via equação de Pell." Universidade Federal de Goiás, 2015. http://repositorio.bc.ufg.br/tede/handle/tede/4793.

Full text
Abstract:
Submitted by Cássia Santos (cassia.bcufg@gmail.com) on 2015-10-27T14:48:51Z No. of bitstreams: 2 Dissertação - Ronaldo Pires da Silva - 2015.pdf: 1653286 bytes, checksum: 63a72d8fbcc7390f80fb41dbadaaa9fe (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-27T14:53:07Z (GMT) No. of bitstreams: 2 Dissertação - Ronaldo Pires da Silva - 2015.pdf: 1653286 bytes, checksum: 63a72d8fbcc7390f80fb41dbadaaa9fe (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<
APA, Harvard, Vancouver, ISO, and other styles
9

Santana, Erivaldo Ribeiro. "O problema da quadratura do círculo: uma abordagem histórica sob a perspectiva atual." Universidade Federal do Amazonas, 2015. http://tede.ufam.edu.br/handle/tede/4551.

Full text
Abstract:
Submitted by Kamila Costa (kamilavasconceloscosta@gmail.com) on 2015-08-07T13:59:57Z No. of bitstreams: 1 Dissertacao - Erivaldo R. Santana.pdf: 3301648 bytes, checksum: f3e68eae0be26f8d67132dc1bd792d18 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2015-08-07T14:09:31Z (GMT) No. of bitstreams: 1 Dissertacao - Erivaldo R. Santana.pdf: 3301648 bytes, checksum: f3e68eae0be26f8d67132dc1bd792d18 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2015-08-07T14:11:00Z (GMT
APA, Harvard, Vancouver, ISO, and other styles
10

Lopes, Aislan Sirino. "CritÃrio para a construtibilidade de polÃgonos regulares por rÃgua e compasso e nÃmeros construtÃveis." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12590.

Full text
Abstract:
CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior<br>Este trabalho aborda construÃÃes geomÃtricas elementares e de polÃgonos regulares realizadas com rÃgua nÃo graduada e compasso respeitando as regras ou operaÃÃes elementares usadas na Antiguidade pelos gregos. Tais construÃÃes serÃo inicialmente tratadas de uma forma puramente geomÃtrica e, a fim de encontrar um critÃrio que possa determinar a possibilidade de construÃÃo de polÃgonos regulares, passarÃo a ser discutidas por um viÃs algÃbrico. Este tratamento algÃbrico evidenciarà uma relaÃÃo entre a geometria e a Ãlgebra, em especi
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Polygonal number"

1

1934-, Deza M., ed. Figurate numbers. World Scientific, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bussotti, Paolo. Sulle orme di Fermat: Il teorema dei numeri poligonali e la sua dimostrazione. Agorà Publishing, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Leven, D. On the number of critical free contacts of a convex polygonal object moving in 2-D polygonal space. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wessel, Caspar. On the analytical representation of direction: An attempt applied chiefly to solving plane and spherical polygons, 1797. Reitzel, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Society, European Mathematical, ed. Thomas Harriot's doctrine of triangular numbers: The 'Magisteria magna'. European Mathematical Society, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Figurate Numbers. World Scientific Publishing Co Pte Ltd, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

colo, animail. Color by Number: Artsy Fox Foxy Colorful Polygonal Animal Love Gift - Animals Coloring Books for Kids - 8. 5 X 11 Inches. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Color by Number: Artsy Duck Bird Cute Pet Animal Polygonal Gift - Animals Coloring Books for Kids - 8. 5 X 11 Inches. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Harms, Heiderose. Address Book: Polygonal Cover Address Book, Record Birthday, Phone Number, Address, Email and Notes, 120 Pages, Size 8. 5 X 11 Design by Heiderose Harms. Independently Published, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Silva, Sidney. A ousadia do π ser racional. Brazil Publishing, 2020. http://dx.doi.org/10.31012/978-65-5861-280-3.

Full text
Abstract:
Pi (π) is used to represent the most known mathematical constant. By definition, π is the ratio of the circumference of a circle to its diameter. In other words, π is equal to the circumference divided by the diameter (π = c / d). Conversely, the circumference is equal to π times the diameter (c = π . d). No matter how big or small a circle is, pi will always be the same number. The first calculation of π was made by Archimedes of Syracuse (287-212 BC) who approached the area of a circle using the Pythagorean Theorem to find the areas of two regular polygons: the polygon inscribed within the c
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Polygonal number"

1

Anglin, W. S. "The Polygonal Number Theorem." In Kluwer Texts in the Mathematical Sciences. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-011-0285-8_6.

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

Nathanson, Melvyn B. "Sums of Polygonal Numbers." In Analytic Number Theory and Diophantine Problems. Birkhäuser Boston, 1987. http://dx.doi.org/10.1007/978-1-4612-4816-3_17.

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

Chan, W. S., and F. Chin. "Approximation of polygonal curves with minimum number of line segments." In Algorithms and Computation. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56279-6_90.

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

De Ita, Guillermo, Pedro Bello, Meliza Contreras, and Juan C. Catana-Salazar. "Efficient Counting of the Number of Independent Sets on Polygonal Trees." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39393-3_17.

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

Somanath, Manju, Radhika Das, and V. A. Bindu. "Structure of Different Categories of Diophantine 3-Tuples Appropriate (2j, 3)-Centered Polygonal Number." In Springer Proceedings in Mathematics & Statistics. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-1505-6_17.

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

Nathanson, Melvyn B. "Sums of polygons." In Additive Number Theory. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4757-3845-2_1.

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

Tanigawa, Shin-ichi, and Naoki Katoh. "Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths." In Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11775096_16.

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

Nechayeva, Marina, and Burton Randol. "Asymptotics of Weighted Lattice Point Counts Inside Dilating Polygons." In Additive Number Theory. Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68361-4_20.

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

He, Xin, Chenlei Lv, Pengdi Huang, and Hui Huang. "WindPoly: Polygonal Mesh Reconstruction via Winding Numbers." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-72970-6_17.

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

Adelberg, Arnold. "Higher Order Bernoulli Polynomials and Newton Polygons." In Applications of Fibonacci Numbers. Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-011-5020-0_1.

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

Conference papers on the topic "Polygonal number"

1

Endo, Rei, Taro Miyazaki, Takahiro Mochizuki, and Yoshihiko Kawai. "Polygon Pixel IoU: Similarity Metric between Polygons with Different Number of Vertices for Arbitrary-Shaped Text Spotting." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10890127.

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

Sanz, Jorge L. C., Its’hak Dinstein, and Dragutin Petkovic. "Computing Polygonal Masks in Pipeline Architectures for Automated Visual Inspection Applications." In Machine Vision. Optica Publishing Group, 1985. http://dx.doi.org/10.1364/mv.1985.fb4.

Full text
Abstract:
In image analysis and computer graphics there are many different application problems which require the computation (and drawing) of binary and multi-tone (colored) digital polygonal masks. It is necessary to clarify that ’binary digital polygonal mask’ should be understood as to mean a (0-1) image where the set of pixels with value 1 describe a digital planar polygon of arbitrary number of vertices. In other words, if P denotes a digital planar polygon, we would like to obtain an image Is such that More generally, we may be given more than one polygon in the same image. In this case, we would
APA, Harvard, Vancouver, ISO, and other styles
3

Feng, Si Wei, and Jingjin Yu. "Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines." In 2022 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2022. http://dx.doi.org/10.1109/icra46639.2022.9812256.

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

Groshong, Bennett, and Wesley Snyder. "Extraction of Polygonal faces in Range Images." In Machine Vision. Optica Publishing Group, 1985. http://dx.doi.org/10.1364/mv.1985.thc2.

Full text
Abstract:
A project has been underway for several months at North Carolina State University concerning the identification of objects in range images. A range image is a two dimensional array of numbers in which each number represents, not the brightness at a point, but rather the distance to that point. From such an image, the three dimensional position of each visible surface point may be computed.
APA, Harvard, Vancouver, ISO, and other styles
5

Krishnan, Shankar, and Dinesh Manocha. "Computing Boolean Combinations of Solids Composed of Free-Form Surfaces." In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/dfm-1296.

Full text
Abstract:
Abstract We present efficient and accurate algorithms for Boolean combinations of solids composed of sculptured models. The surface of each solid is represented as a collection of trimmed and untrimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons, partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and ray-shooting, the boundaries of the resulting solids and its connectivity graph after the Boolean operation are computed. The algorithm has been implemented and its performance measured on a number o
APA, Harvard, Vancouver, ISO, and other styles
6

Daescu, Ovidiu, Joseph S. B. Mitchell, Simeon Ntafos, James D. Palmer, and Chee K. Yap. "Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions." In the twenty-second annual symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1137856.1137930.

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

Bastien, J., C. H. Lamarque, and M. Schatzman. "Study of Some Rheological Elastoplastic Models With a Finite Number of Degrees of Freedom." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/vib-8081.

Full text
Abstract:
Abstract A large number of rheological models can be covered by the existence and uniqueness theory for maximal monotone operators. Numerical simulations display hysteresis cycles when the forcing is periodic. A given shape of hysteresis cycle in an appropriate class of polygonal cycles can always be realized by adjusting the physical parameters of the rheological model.
APA, Harvard, Vancouver, ISO, and other styles
8

Natarajan, R., and N. G. Naganathan. "A Reference Point Algorithm for Planar Path Planning Strategies." In ASME 1989 Design Technical Conferences. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/detc1989-0059.

Full text
Abstract:
Abstract This paper presents a simple and efficient algorithm to find a collision free path for a convex polygonal object moving amidst fixed convex polygonal obstacles. Given the initial and the final positions and orientations of the object, the positions and the orientations of the obstacles, the algorithm traces a collision free path. The algorithm identifies reference points at the centroids of these polygonal entities, configures potential candidate obstacles for collision, analyzes the type of collision, and devises a simple method to avoid the obstacles. The reference points help in lo
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Shiang-Fong, James H. Oliver, and David Fernandez-Baca. "A Fast Algorithm for Planning Collision-Free Paths With Rotations." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dac-4002.

Full text
Abstract:
Abstract Motion planning is a major problem in robotics. The objective is to plan a collision-free path for a robot moving through a workspace populated with obstacles. In this paper, we present a fast and practical algorithm for moving a convex polygonal robot among a set of polygonal obstacles with translations and rotations. The running time is O(c((n + k)N + nlogn)), where c is a parameter controlling the precision of the results, n is the total number of obstacle vertices, k is the number of intersections of configuration space obstacles, and N is the number of obstacles, decomposed into
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Yong. "Robust and Accurate Boolean Operations on Polygonal Models." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35731.

Full text
Abstract:
We present a new sampling-based method for the efficient and reliable calculation of boundary surface defined by a Boolean operation of given polygonal models. We first construct uniform volumetric cells with sampling points for each geometric element of polygonal models. We then calculate an error-minimizing point in each cell based on a quadratic error function (QEF). Based on a novel adaptive sampling condition, we construct adaptive octree cells such that a QEF point in each cell can capture the shape of all the geometric elements inside the cell. Finally we reconstruct a polygonal model f
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Polygonal number"

1

Jordan, Thomas, Marguerite Madden, Thomas Jordan, and Marguerite Madden. Digital vegetation database and map for Big South Fork National River and Recreation Area: Final report. National Park Service, 2024. http://dx.doi.org/10.36967/2305475.

Full text
Abstract:
This report describes the vegetation mapping procedures employed by the Center for Remote Sensing and Mapping Science (CRMS), Department of Geography, University of Georgia, for the Big South Fork National River and Recreation Area (BISO) in the Appalachian Highlands Inventory and Monitoring Network (APHN) of the National Park Service under Cooperative Agreement No. H5028 01 0651, entitled, ?Digital Vegetation Databases and Maps for National Park Service Units in the Appalachian Highlands and Cumberland/ Piedmont Networks?. Big South Fork National River and Recreation Area (BISO) is located in
APA, Harvard, Vancouver, ISO, and other styles
2

Rodriguez, Dirk, and Cameron Williams. Channel Islands National Park: Vegetation classification and mapping project report. National Park Service, 2025. https://doi.org/10.36967/2311434.

Full text
Abstract:
In 2012, Channel Islands National Park (CHIS), with support and funding from the National Park Service’s (NPS) National Vegetation Mapping Inventory (VMI) Program, initiated new vegetation classifications and maps for four northern Channel Islands—Anacapa Island (ANI), Santa Rosa Island (SRI), Santa Cruz Island (SCI), and San Miguel Island (SMI). The project was conducted in two distinct phases. Phase 1 consisted of a mapping and classification effort for ANI, SRI, and SMI. Phase 2 mapped and classified the vegetation for SCI alone. Initial site visits and reconnaissance were conducted jointly
APA, Harvard, Vancouver, ISO, and other styles
3

Taverna, Kristin. Vegetation classification and mapping of land additions at Richmond National Battlefield Park, Virginia: Addendum to technical report NPS/NER/NRTR 2008/128. National Park Service, 2022. http://dx.doi.org/10.36967/2294278.

Full text
Abstract:
In 2008 and 2015, the Virginia Department of Conservation and Recreation, Division of Natural Heritage produced vegetation maps for Richmond National Battlefield Park, following the protocols of the United States Geological Survey (USGS) – National Park Service (NPS) Vegetation Mapping Program. The original 2008 report was part of a regional project to map and classify the vegetation in seven national parks in Virginia. The 2015 report was an addendum to the original report and mapped the vegetation in newly acquired parcels. Since 2015, the park has acquired an additional 820 acres of land wi
APA, Harvard, Vancouver, ISO, and other styles
4

Ley, Matt, Tom Baldvins, Hannah Pilkington, David Jones, and Kelly Anderson. Vegetation classification and mapping project: Big Thicket National Preserve. National Park Service, 2024. http://dx.doi.org/10.36967/2299254.

Full text
Abstract:
The Big Thicket National Preserve (BITH) vegetation inventory project classified and mapped vegetation within the administrative boundary and estimated thematic map accuracy quantitatively. National Park Service (NPS) Vegetation Mapping Inventory Program provided technical guidance. The overall process included initial planning and scoping, imagery procurement, vegetation classification field data collection, data analysis, imagery interpretation/classification, accuracy assessment (AA), and report writing and database development. Initial planning and scoping meetings took place during May, 2
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Polygonal number' for particular source types:
Journal articles Dissertations / Theses Books
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