Log in

Relevant bibliographies by topics / Polygones convexes

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Polygones convexes'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

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 'Polygones convexes.'

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 "Polygones convexes"

1

Laurentin, Jérôme. "Réflexions sur la triangulation des polygones convexes." Bulletin de la Sabix, no. 44 (October 1, 2009): 141–50. http://dx.doi.org/10.4000/sabix.693.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

BRUCKSTEIN, ALFRED M., GUILLERMO SAPIRO, and DORON SHAKED. "EVOLUTIONS OF PLANAR POLYGONS." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 06 (1995): 991–1014. http://dx.doi.org/10.1142/s0218001495000407.

Full text

Abstract:

Evolutions of closed planar polygons are studied in this work. In the first part of the paper, the general theory of linear polygon evolutions is presented, and two specific problems are analyzed. The first one is a polygonal analog of a novel affine-invariant differential curve evolution, for which the convergence of planar curves to ellipses was proved. In the polygon case, convergence to polygonal approximation of ellipses, polygo nal ellipses, is proven. The second one is related to cyclic pursuit problems, and convergence, either to polygonal ellipses or to polygonal circles, is proven. I

APA, Harvard, Vancouver, ISO, and other styles

3

RAWDON, ERIC J., and JONATHAN K. SIMON. "POLYGONAL APPROXIMATION AND ENERGY OF SMOOTH KNOTS." Journal of Knot Theory and Its Ramifications 15, no. 04 (2006): 429–51. http://dx.doi.org/10.1142/s0218216506004543.

Full text

Abstract:

We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Möbius Energy of the smooth knot as the polygons converge to the smooth knot. For this to work, the polygons must converge in a "nice" way, and the energies must be correctly regularized. We determine an explicit error bound for the convergence.

APA, Harvard, Vancouver, ISO, and other styles

4

Glick, Max. "The Limit Point of the Pentagram Map." International Mathematics Research Notices 2020, no. 9 (2018): 2818–31. http://dx.doi.org/10.1093/imrn/rny110.

Full text

Abstract:

Abstract The pentagram map is a discrete dynamical system defined on the space of polygons in the plane. In the 1st paper on the subject, Schwartz proved that the pentagram map produces from each convex polygon a sequence of successively smaller polygons that converges exponentially to a point. We investigate the limit point itself, giving an explicit description of its Cartesian coordinates as roots of certain degree three polynomials.

APA, Harvard, Vancouver, ISO, and other styles

5

MA, JUN, and JUDY HOLDENER. "WHEN THUE-MORSE MEETS KOCH." Fractals 13, no. 03 (2005): 191–206. http://dx.doi.org/10.1142/s0218348x05002908.

Full text

Abstract:

In this paper, we reveal a remarkable connection between the Thue-Morse sequence and the Koch snowflake. Using turtle geometry and polygon maps, we realize the Thue-Morse sequence as the limit of polygonal curves in the plane. We then prove that a sequence of such curves converges to the Koch snowflake in the Hausdorff metric. In the final section we consider generalized Thue-Morse sequences and provide a characterization of those that encode curves converging to the Koch snowflake.

APA, Harvard, Vancouver, ISO, and other styles

6

Skomra, Mateusz, and Stéphan Thomassé. "Convexly independent subsets of Minkowski sums of convex polygons." Discrete Mathematics 344, no. 8 (2021): 112472. http://dx.doi.org/10.1016/j.disc.2021.112472.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Long, Vena M. "From Polygons to Poetry." Mathematics Teaching in the Middle School 6, no. 8 (2001): 436–38. http://dx.doi.org/10.5951/mtms.6.8.0436.

Full text

Abstract:

MY ODYSSEY AS A TEACHER OF MATHEMATICS began in the late '60s in the rural midwest. Professional development in those days was a matter of personal development. My most treasured resource was the Mathematics Teacher. It was virtually my only opportunity to “converse” with others about mathematics and about teaching. Each month I devoured it from cover to cover on the evening of its arrival and took something from it into the classroom the next day.

APA, Harvard, Vancouver, ISO, and other styles

8

Khovanskii, A. G. "Newton polygons, curves on torus surfaces, and the converse Weil theorem." Russian Mathematical Surveys 52, no. 6 (1997): 1251–79. http://dx.doi.org/10.1070/rm1997v052n06abeh002156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Grabowski, Adam. "Polygonal Numbers." Formalized Mathematics 21, no. 2 (2013): 103–13. http://dx.doi.org/10.2478/forma-2013-0012.

Full text

Abstract:

Summary In the article the formal characterization of triangular numbers (famous from [15] and words “EYPHKA! num = Δ+Δ+Δ”) [17] is given. Our primary aim was to formalize one of the items (#42) from Wiedijk’s Top 100 Mathematical Theorems list [33], namely that the sequence of sums of reciprocals of triangular numbers converges to 2. This Mizar representation was written in 2007. As the Mizar language evolved and attributes with arguments were implemented, we decided to extend these lines and we characterized polygonal numbers. We formalized centered polygonal numbers, the connection between

APA, Harvard, Vancouver, ISO, and other styles

10

MAZZEO, RAFE, and JULIE ROWLETT. "A heat trace anomaly on polygons." Mathematical Proceedings of the Cambridge Philosophical Society 159, no. 2 (2015): 303–19. http://dx.doi.org/10.1017/s0305004115000365.

Full text

Abstract:

AbstractLet Ω0be a polygon in$\mathbb{R}$2, or more generally a compact surface with piecewise smooth boundary and corners. Suppose that Ωεis a family of surfaces with${\mathcal C}$∞boundary which converges to Ω0smoothly away from the corners, and in a precise way at the vertices to be described in the paper. Fedosov [6], Kac [8] and McKean–Singer [13] recognised that certain heat trace coefficients, in particular the coefficient oft0, are not continuous as ε ↘ 0. We describe this anomaly using renormalized heat invariants of an auxiliary smooth domainZwhich models the corner formation. The re

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Polygones convexes"

1

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

2

El, Oraiby Wael. "K-set Polygons and Centroid Triangulations." Phd thesis, Université de Haute Alsace - Mulhouse, 2009. http://tel.archives-ouvertes.fr/tel-00871192.

Full text

Abstract:

This thesis is a contribution to a classical problem in computational and combinatorial geometry: the study of the k-sets of a set V of n points in the plane. First we introduce the notion of convex inclusion chain that is an ordering of the points of V such that no point is inside the convex hull of the points that precede it. Every k-set of an initial sub-sequence of the chain is called a k-set of the chain. We prove that the number of these k-sets is an invariant of V and is equal to the number of regions in the order-k Voronoi diagram of V. We then deduce an online algorithm for the constr

APA, Harvard, Vancouver, ISO, and other styles

3

Guichard, Christelle. "Les nombres de Catalan et le groupe modulaire PSL2(Z)." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM057/document.

Full text

Abstract:

Dans ce mémoire de thèse, on étudie le morphisme de monoïde $mu$du monoïde libre sur l'alphabet des entiers $nb$,`a valeurs dans le groupe modulaire $PSL_2(zb)$,considéré comme monoïde, défini pour tout entier $a$ par $mu(a)=begin{pmatrix} 0 & -1 1 & a+1 end{pmatrix}.$Les nombres de Catalan apparaissent naturellement dans l'étudede sous-ensembles du noyau de $mu$.Dans un premier temps, on met en évidence deux systèmes de réécriture, l'un sur l'alphabet fini ${0,1}$, l'autresur l'alphabet infini des entiers $nb$ et on montreque ces deux systèmes de réécriture définissent des présentatio

APA, Harvard, Vancouver, ISO, and other styles

4

Rafique, Emran Carleton University Dissertation Computer Science. "On asymptotic algorithms for approximating arbitrary polygons by simpler convex polygons." Ottawa, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Seater, Robert. "Minkowski sum decompositions of convex polygons." Diss., Connect to the thesis, 2002. http://hdl.handle.net/10066/1479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Calcoen, Emmanuelle. "Approximation polygonales d'objets convexes du plan pour la geometrie algorythmique." Université Joseph Fourier (Grenoble), 1996. http://www.theses.fr/1996GRE10025.

Full text

Abstract:

La geometrie algorithmique a resolu de tres nombreux problemes sur des structures lineaires: ensembles de points, polygones dans cette these, nous nous interessons a des problemes de geometrie algorithmique concernant des objets non lineaires. Pour cela, nous introduisons la notion de convexe-f b, objet convexe du plan dont la frontiere est une union convexe de courbes de bezier dont les polygones de controle sont convexes. Nous sommes naturellement amenes a etudier les relations entre une courbe de bezier convexe et la convexite des polygones obtenus par subdivision. Pour tout convexe-f b, pa

APA, Harvard, Vancouver, ISO, and other styles

7

Jabbari, Zohreh. "Optimally sweeping convex polygons with two and three guards." Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/24248.

Full text

Abstract:

Given a polygon P, we considered the problem of finding the shortest total paths for two and three mobile guards to cover P. In our definition of the problem, we do not limit the movements of the guards. The guards are allowed to start their paths at any point on the polygon, cross the interior or intersect each other's paths if necessary. A polygon P is covered by two guards if every point in P is on the line that connects the guards at some point in time. We proved that if the polygon is convex, the optimal sweep limits the paths of the guards to the perimeter of the polygon. In the optimal

APA, Harvard, Vancouver, ISO, and other styles

8

Fraiji, Nicolas. "Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0029/MQ67822.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hu, Hai-Tao. "Diagramme de Voronoï généralisé pour un ensemble de polygones." Grenoble 1, 1991. http://tel.archives-ouvertes.fr/tel-00339655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mansouri, Minou. "On the reachability region of a ladder in two convex polygons." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Polygones convexes"

1

Dobkin, David P. Searching for empty convex polygons. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Aggarwal, Alok. Finding minimal convex nested polygons. Courant Institute of Mathematical Sciences, New York University, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Potts, Jeffrey Hal. The decomposition of an arbitrary three-dimensional planar polygon into a set of convex polygons. Naval Postgraduate School, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Edelsbrunner, Herbert. Probing convex polygons with x-rays. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Edelsbrunner, Herbert. Minimum polygonal separation. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rice, J. Internal and covering scan-conversion of convex polygons. Trinity College, Department of Computer Science, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kedem, K. An efficient motion planning algorithm for a convex polygonal object in 2-dimensional polygonal space. Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kedem, K. An efficient motion planning algorithm for a convex polygonal object in 2-dimensional polygonal space. Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

10

Potts, Jeffrey Hal. The decomposition of an arbitrary three-dimensional planar polygon into a set of convex polygons. 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Polygones convexes"

1

Ahadi, Arash, Amirhossein Mozafari, and Alireza Zarei. "Touring Convex Polygons in Polygonal Domain Fences." In Combinatorial Optimization and Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71147-8_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Barequet, Gill, and Minati De. "Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53007-9_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fishburn, Peter. "Distances in Convex Polygons." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60406-5_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fischer, Paul. "Finding maximum convex polygons." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57163-9_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fishburn, Peter. "Distances in Convex Polygons." In The Mathematics of Paul Erdős I. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7258-2_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mankowski, Michal, and Mikhail Moshkov. "Convex Polygon Triangulation." In Dynamic Programming Multi-Objective Combinatorial Optimization. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-63920-4_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dumitrescu, Adrian, and Csaba D. Tóth. "Convex Polygons in Geometric Triangulations." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21840-3_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Rosin, Paul L., and Joviša Žunić. "Measuring Convexity via Convex Polygons." In Image and Video Technology – PSIVT 2015 Workshops. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30285-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

van Leeuwen, Erik Jan, and Jan van Leeuwen. "Convex Polygon Intersection Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18469-7_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Brimkov, Valentin E., Sean Kafer, Matthew Szczepankiewicz, and Joshua Terhaar. "On Intersection Graphs of Convex Polygons." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07148-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Polygones convexes"

1

Burton, Greg. "A Hybrid Approach to Polygon Offsetting Using Winding Numbers and Partial Computation of the Voronoi Diagram." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34303.

Full text

Abstract:

In this paper we present a new, efficient algorithm for computing the “raw offset” curves of 2D polygons with holes. Prior approaches focus on (a) complete computation of the Voronoi Diagram, or (b) pair-wise techniques for generating a raw offset followed by removal of “invalid loops” using a sweepline algorithm. Both have drawbacks in practice. Robust implementation of Voronoi Diagram algorithms has proven complex. Sweeplines take O((n + k)log n) time and O(n + k) memory, where n is the number of vertices and k is the number of self-intersections of the raw offset curve. It has been shown th

APA, Harvard, Vancouver, ISO, and other styles

2

Reckhow, R. A., and J. Culberson. "Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons." In the third annual symposium. ACM Press, 1987. http://dx.doi.org/10.1145/41958.41987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chew, L. P., and K. Kedem. "Placing the largest similar copy of a convex polygon among polygonal obstacles." In the fifth annual symposium. ACM Press, 1989. http://dx.doi.org/10.1145/73833.73853.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Müller-Hannemann, Matthias, and Karsten Weihe. "Minimum strictly convex quadrangulations of convex polygons." In the thirteenth annual symposium. ACM Press, 1997. http://dx.doi.org/10.1145/262839.262960.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lien, Jyh-Ming, and Nancy M. Amato. "Approximate convex decomposition of polygons." In the twentieth annual symposium. ACM Press, 2004. http://dx.doi.org/10.1145/997817.997823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Duan, Liuyun, and Florent Lafarge. "Image partitioning into convex polygons." In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2015. http://dx.doi.org/10.1109/cvpr.2015.7298931.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Aggarwal, Alok, Heather Booth, Joseph O'Rourke, Subhash Suri, and Chee K. Yap. "Finding minimal convex nested polygons." In the first annual symposium. ACM Press, 1985. http://dx.doi.org/10.1145/323233.323271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dobkin, D. P., H. Edelsbrunner, and M. H. Overmars. "Searching for empty convex polygons." In the fourth annual symposium. ACM Press, 1988. http://dx.doi.org/10.1145/73393.73416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Guttmann, A. J. "Planar polygons; Regular, convex, almost convex, staircase and row convex." In Computer-aided statistical physics. AIP, 1992. http://dx.doi.org/10.1063/1.41939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Vahedi, M., and A. F. van der Stappen. "Caging convex polygons with three fingers." In 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 2008. http://dx.doi.org/10.1109/iros.2008.4650892.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Polygones convexes"

1

DiDonato, Armido R. An Algorithm to Find the Intersection of Two Convex Polygons. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada274722.

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!