Academic literature on the topic 'Droites discrètes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Contents
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Droites discrètes.'
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 "Droites discrètes"
Gérard, Yan. "Analyse locale des droites discrètes. Généralisation et application à la connexité des plans discrets." Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 324, no. 12 (June 1997): 1419–24. http://dx.doi.org/10.1016/s0764-4442(97)83586-0.
Full textFrançois, Stéphane, and Adrien Nonjon. "« Nous sommes ce que vous fûtes, nous serons ce que vous êtes. »." Passés politisés, no. 9 (December 15, 2023): 21–30. http://dx.doi.org/10.35562/frontieres.1820.
Full textMahé, Anne-Laure. "Documenter les licenciements arbitraires en contexte autoritaire : les archives comme pratique contestataire au Soudan (1989-2019)." Critique internationale N° 102, no. 1 (January 25, 2024): 93–118. http://dx.doi.org/10.3917/crii.102.0093.
Full textJacquet-Vaillant, Marion. "« La disparition » : les usages de la discrétion dans l’agir de Génération identitaire." Politix 138, no. 2 (February 13, 2023): 153–81. http://dx.doi.org/10.3917/pox.138.0153.
Full textRobillard, Denise. "L’Ordre de Jacques Cartier et les droits des Franco-catholiques en Ontario, 1926-1931." Articles 74 (December 9, 2011): 93–111. http://dx.doi.org/10.7202/1006494ar.
Full textCHAMBERT-LOIR, ANTOINE. "THE THEOREM OF JENTZSCH–SZEGŐ ON AN ANALYTIC CURVE: APPLICATION TO THE IRREDUCIBILITY OF TRUNCATIONS OF POWER SERIES." International Journal of Number Theory 07, no. 07 (November 2011): 1807–23. http://dx.doi.org/10.1142/s1793042111004691.
Full textMilor, Alice. "Un bureau à bruxelles : le lobbying des grandes entreprises françaises dans les années 1990." Entreprises et histoire 113, no. 4 (February 14, 2024): 160–75. http://dx.doi.org/10.3917/eh.113.0160.
Full textMattina, Cesare. "Des pratiques ordinaires et pourtant fort dénoncées. Réflexions sur la dimension clientélaire des politiques publiques à partir du laboratoire marseillais." Revue internationale de politique comparée Vol. 30, no. 3 (July 9, 2024): 53–77. http://dx.doi.org/10.3917/ripc.303.0053.
Full textBENADJAOUD, A., and J. J. LAUVERGNE. "Comparaison de 14 races ovines françaises autochtones par l’indice d’archaïsme." INRAE Productions Animales 4, no. 4 (October 2, 1991): 321–28. http://dx.doi.org/10.20870/productions-animales.1991.4.4.4346.
Full textTroesch, Albert. "Droites discrètes et calendriers." Mathématiques et sciences humaines, no. 141 (March 1, 1998). http://dx.doi.org/10.4000/msh.2760.
Full textDissertations / Theses on the topic "Droites discrètes"
Labbé, Sébastien. "Structure des pavages, droites discrètes 3D et combinatoire des mots." Thèse, Paris 7, 2012. http://www.archipel.uqam.ca/4940/1/D2363.pdf.
Full textLaboureix, Bastien. "Hyperplans arithmétiques : connexité, reconnaissance et transformations." Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0040.
Full textThe digital world is littered with discrete mathematical structures, designed to be easily manipulated by a computer while giving our brains the impression of beautiful continuous real shapes. Digital images can thus be seen as subsets of Z^2. In discrete geometry, we are interested in the structures of Z^d and seek to establish geometric or topological properties on these objects. While the questions we ask are relatively simple in Euclidean geometry, they become much more difficult in discrete geometry: no more division, goodbye to limits, everything is just arithmetic. This thesis is also an opportunity to juggle many elementary notions of mathematics and computer science (linear algebra, rings, automata, real analysis, arithmetic, combinatorics) to solve discrete geometry questions. We are interested in the fundamental structures of this geometry: arithmetic hyperplanes. These have a very simple and purely arithmetical definition: an arithmetical hyperplane is the set of integer points lying between two parallel (real) affine hyperplanes. In this thesis, we discuss three problems involving arithmetic hyperplanes:- connectedness: is an arithmetic hyperplane composed of a single piece or of several pieces? The main contribution of this manuscript is to extend results already known for facewise connectedness for any neighbourhood. While certain phenomena remain in the general case, the combinatorial explosion makes it difficult to adapt known algorithms to solve the problem. We therefore adopt an analytical approach and prove connectivity properties by studying the regularity of a function. - recognition: how can we find out the characteristics of an arithmetic hyperplane? This is a more traditional problem in discrete geometry, with a very rich literature. To solve it, we propose a recognition algorithm based on the generalised Stern-Brocot tree. In particular, we introduce the notion of separating chord, which geometrically characterises the zones to which the parameters of an arithmetic hyperplane belong. - soft transformations: how can an arithmetic hyperplane be continuously transformed using translations or rotations? A discrete approach to homotopic transformations, we characterise the possible pixel movements in a discrete structure while preserving its geometric properties. Beyond the study of these problems and the results we were able to obtain, this thesis shows the interest of using the reals, and in particular real analysis, to better understand arithmetic hyperplanes. Arithmetic hyperplanes are largely characterised by their normal vector, which is often considered integer to obtain periodicity properties. Considering any real normal vectors provides greater flexibility and eliminates the noise induced by the arithmetic relationships of the vector. Finally, opening up to the real again is a way of building bridges to other branches of mathematics, such as word combinatorics or numbering systems
Vittone, Joëlle. "Caractérisation et reconnaissance de droites et de plans en géométrie discrète." Université Joseph Fourier (Grenoble), 1999. http://www.theses.fr/1999GRE10278.
Full textDelalleau, Guillaume. "Substitutions sur la droite et dans le plan." Paris 7, 2011. http://www.theses.fr/2011PA077218.
Full textThis memoir is split in two parts of three chapters each. The theme of the first part is S-adic words. The first chapter is concerned with the convergence of S-adic sequences; we propose a general form for the accumulation points of S-adic sequences, and infer from it general sufficient conditions for the convergence. In the second chapter, conditions on the alphabet of substitutions for the S-adic words to form an attractor in the set of infinite words. When these conditions are met, we adumbrate a way to a solution of the S-adic conjecture. The first step, a more systematic study of the factorial complexity of fixed points of substitutions, is taken and partial results are obtained. In the third chapter, we touch upon the question of the existence of frequencies for letters in S-adic words through the action of substitutions on the frequency simplex. The second part is concerned with tilings of the plane with square and colored tiles. In the fifth chapter, we propose a representation of patches by graphs and give necessary and sufficient conditions for a graph to represent a patch. In the sixth chapter we define bidimensional substitutions as transformations of the vertices ans edges of the graph representing patches; necessary and sufficient conditions for a graph thus built to represent a patch are given. In the seventh chapter we propose a construction of S-adic tilings of the plane by square and colored tiles
Ouvrier-Buffet, Cécile. "Construction de définitions / construction de concept : vers une situation fondamentale pour la construction de définitions en mathématiques." Phd thesis, Université Joseph Fourier (Grenoble), 2003. http://tel.archives-ouvertes.fr/tel-00005515.
Full textKhoshnoudirad, Daniel. "Aspects combinatoires des motifs linéaires en géométrie discrète." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1046.
Full textDiscrete Geometry, as Theoretical Computer Science, studies in particular linear patterns such as discrete primitives in images: the discrete lines, discrete segments, the discrete planes, pieces of discrete planes, for example. In this work, I particularly focused on Farey diagrams that appear in the study of the $ (m, n) $ - cubes, ie the pieces of discrete planes. Among others, I study the Combinatorics of the Farey lines forming diagram Farey, establishing exact formulas. I also get an asymptotic estimate using Combinatorial Number Theory. Then, I get a lower bound for the cardinality of the Farey vertices. After that, we analyze the strategies used in the literature for the study of (m, n)- cubes only by Farey diagrams in two dimensions. In order to get new and more accurate bounds for (m, n)- cubes, one of the few available methods, is to propose a generalization for the concept of preimage of a discrete segment for (m, n) - cube, resulting in a new combinatorial inequality. Thus, we introduce the notion Farey diagram in three dimensions
Ghannam, Boutros. "Modélisation ultra-rapide des transferts de chaleur par rayonnement et par conduction et exemple d'application." Phd thesis, Ecole Nationale Supérieure des Mines de Paris, 2012. http://pastel.archives-ouvertes.fr/pastel-00958145.
Full textSaid, Mouhammad. "Géométrie multi-résolution des objets discrets bruités." Grenoble, 2010. http://www.theses.fr/2010GRENM084.
Full textBoundary curves are compact and descriptive means for defining regions or shapes in the plane. It is well known that shapes should be studied at different scales. This has led to the development of regular and irregular pyramids for shape analysis and scene understanding. However there exists no analytical description of the multiresolution of a digital shape, contrary to the famous scale-space analysis in the continuous world. Moreover, in the context of digital geometry, geometric primitives such as lines, circles or polynomials are of a great importance. For instance, pieces of digital lines are excellent tangent estimators, circular arcs estimate curvature. It is thus fundamental to keep them in the multiscale analysis of digital boundaries. One of the contribution of this thesis is to give new analytical results on the multiresolution of Digital Straight Line (DSL) and Digital Straight Segment (DSS). Figueiredo is the first one who studied the behavior of 8-connected lines when changing the resolution of the grid [41]. In this work, we consider a standard digital line. The objective is to provide an analytic description of digital straight line DSL when the resolution of the grid is changed by an arbitrary factor. We also prove that their subsampling is a standard digital line. As analytical formulae for DSS appear to be a much harder problem and DSS are finite parts of DSL, we propose an indirect path to DSS multiresolution. Given a DSS, we build two DSL whose intersection contains it and whose main connected part has the same arithmetic characteristics as well as the same number of patterns. We note here that we propose new results about the combinatorics of such digital line intersections. We determine the multiresolution of DSS by examining the multiresolution of the intersection of these two DSL. We give a new analytical description of this set with arithmetic inequalities. We also address the problem of computing the exact characteristics of any subsegment of digital straight line with known characteristics. We present two new algorithms SmartDSS and ReversedSmartDSS that solve this problem. Their principle is to climb the Stern-Brocot tree of fraction either in a top-down or bottom-up way. Their worst-time complexity are better than the classical DSS recognition algorithm. Both algorithms are useful to compute efficiently the multiresolution of a DSS. The noise along digital contours is not really detected but is rather canceled out by thickening digital straight segments. The thickness is tuned by a user and set globally for the contour. To overcome this issue, we propose an original strategy to detect locally both the amount of noise and the meaningful thickness of each point of a digital contour. This work is based on the asymptotic properties of blurred segments with different thicknesses and forms an alternative to the multiscale approach to noise detection
Books on the topic "Droites discrètes"
Ontario. Esquisse de cours 12e année: Géométrie et mathématiques discrètes mga4u cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Find full text