Auswahl der wissenschaftlichen Literatur zum Thema „Polyhedral subdivisions“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Polyhedral subdivisions" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Polyhedral subdivisions"
Tawarmalani, Mohit, Jean-Philippe P. Richard und Chuanhui Xiong. „Explicit convex and concave envelopes through polyhedral subdivisions“. Mathematical Programming 138, Nr. 1-2 (31.07.2012): 531–77. http://dx.doi.org/10.1007/s10107-012-0581-4.
Der volle Inhalt der QuelleAthanasiadis, Christos A., und Francisco Santos. „On the topology of the Baues poset of polyhedral subdivisions“. Topology 41, Nr. 3 (Mai 2002): 423–33. http://dx.doi.org/10.1016/s0040-9383(00)00044-6.
Der volle Inhalt der QuelleBihan, Frédéric, und Ivan Soprunov. „Criteria for strict monotonicity of the mixed volume of convex polytopes“. Advances in Geometry 19, Nr. 4 (25.10.2019): 527–40. http://dx.doi.org/10.1515/advgeom-2018-0024.
Der volle Inhalt der QuelleCHEUNG, YAM KI, und OVIDIU DAESCU. „FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS“. Discrete Mathematics, Algorithms and Applications 02, Nr. 02 (Juni 2010): 161–79. http://dx.doi.org/10.1142/s1793830910000644.
Der volle Inhalt der QuelleBishop, Joseph E., und N. Sukumar. „Polyhedral finite elements for nonlinear solid mechanics using tetrahedral subdivisions and dual-cell aggregation“. Computer Aided Geometric Design 77 (Februar 2020): 101812. http://dx.doi.org/10.1016/j.cagd.2019.101812.
Der volle Inhalt der QuelleMakovicky, E., und T. Balić-Žunić. „New Measure of Distortion for Coordination Polyhedra“. Acta Crystallographica Section B Structural Science 54, Nr. 6 (01.12.1998): 766–73. http://dx.doi.org/10.1107/s0108768198003905.
Der volle Inhalt der QuelleLocatelli, Marco. „Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes“. Journal of Global Optimization 66, Nr. 4 (18.02.2016): 629–68. http://dx.doi.org/10.1007/s10898-016-0418-4.
Der volle Inhalt der QuelleMine, Kotaro, und Katsuro Sakai. „Subdivisions of Simplicial Complexes Preserving the Metric Topology“. Canadian Mathematical Bulletin 55, Nr. 1 (01.03.2012): 157–63. http://dx.doi.org/10.4153/cmb-2011-055-7.
Der volle Inhalt der QuelleMitchell, Joseph S. B., David M. Mount und Subhash Suri. „Query-Sensitive Ray Shooting“. International Journal of Computational Geometry & Applications 07, Nr. 04 (August 1997): 317–47. http://dx.doi.org/10.1142/s021819599700020x.
Der volle Inhalt der QuelleQousini, Maysoon, Hasan Hdieb und Eman Almuhur. „Applications of Locally Compact Spaces in Polyhedra: Dimension and Limits“. WSEAS TRANSACTIONS ON MATHEMATICS 23 (27.02.2024): 118–24. http://dx.doi.org/10.37394/23206.2024.23.14.
Der volle Inhalt der QuelleDissertationen zum Thema "Polyhedral subdivisions"
McDonald, Terry Lynn. „Piecewise polynomial functions on a planar region: boundary constraints and polyhedral subdivisions“. Texas A&M University, 2003. http://hdl.handle.net/1969.1/3915.
Der volle Inhalt der QuellePhilippe, Eva. „Geometric realizations using regular subdivisions : construction of many polytopes, sweep polytopes, s-permutahedra“. Electronic Thesis or Diss., Sorbonne université, 2024. http://www.theses.fr/2024SORUS079.
Der volle Inhalt der QuelleThis thesis concerns three problems of geometric realizations of combinatorial structures via polytopes and polyhedral subdivisions. A polytope is the convex hull of a finite set of points in a Euclidean space R^d. It is endowed with a combinatorial structure coming from its faces. A subdivision is a collection of polytopes whose faces intersect properly and such that their union is convex. It is regular if it can be obtained by taking the lower faces of a lifting of its vertices in one dimension higher.We first present a new geometric construction of many combinatorially different polytopes of fixed dimension and number of vertices. This construction relies on showing that certain polytopes admit many regular triangulations. It allows us to improve the best known lower bound on the number of combinatorial types of polytopes.We then study the projections of permutahedra, that we call sweep polytopes because they model the possible orderings of a fixed point configuration by hyperplanes that sweep the space in a constant direction. We also introduce and study a combinatorial abstraction of these structures: the sweep oriented matroids, that generalize Goodman and Pollack's theory of allowable sequences to dimensions higher than 2.Finally, we provide geometric realizations of the s-weak order, a combinatorial structure that generalizes the weak order on permutations, parameterized by a vector s with positive integer coordinates. In particular, we answer Ceballos and Pons conjecture that the s-weak order can be realized as the edge-graph of a polytopal complex that is moreover a subdivision of a permutahedron
Moura, Phablo Fernando Soares. „Graph colorings and digraph subdivisions“. Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/.
Der volle Inhalt der QuelleO problema de coloração de grafos é um problema clássico em teoria dos grafos cujo objetivo é particionar o conjunto de vértices em um número mínimo de conjuntos estáveis. Nesta tese apresentamos nossas contribuições sobre três problemas de coloração de grafos e um problema relacionado a uma antiga conjectura sobre subdivisão de digrafos. Primeiramente, abordamos o problema de recoloração convexa no qual é dado um grafo arbitrariamente colorido G e deseja-se encontrar uma recoloração de peso mínimo tal que cada classe de cor induza um subgrafo conexo de G. Mostramos resultados sobre inaproximabilidade, introduzimos uma formulação linear inteira que modela esse problema, e apresentamos alguns resultados computacionais usando uma abordagem de geração de colunas. O problema de k-upla coloração é uma generalização do problema clássico de coloração de vértices e consiste em cobrir o conjunto de vértices de um grafo com uma quantidade mínima de conjuntos estáveis de tal forma que cada vértice seja coberto por pelo menos k conjuntos estáveis (possivelmente idênticos). Apresentamos uma formulação linear inteira para esse problema e fazemos um estudo detalhado do politopo associado a essa formulação. O último problema de coloração estudado nesta tese é o problema de orientação própria. Ele consiste em orientar o conjunto de arestas de um dado grafo de tal forma que vértices adjacentes possuam graus de entrada distintos e o maior grau de entrada seja minimizado. Claramente, os graus de entrada induzem uma partição do conjunto de vértices em conjuntos estáveis, ou seja, induzem uma coloração (no sentido convencional) dos vértices. Nossas contribuições nesse problema são em complexidade computacional e limitantes superiores para grafos bipartidos. Finalmente, estudamos um problema relacionado a uma conjectura de Mader, dos anos oitenta, sobre subdivisão de digrafos. Esta conjectura afirma que, para cada digrafo acíclico H, existe um inteiro f(H) tal que todo digrafo com grau mínimo de saída pelo menos f(H) contém uma subdivisão de H como subdigrafo. Damos evidências para essa conjectura mostrando que ela é válida para classes particulares de digrafos acíclicos.
Wang, Jiaxi. „PARAMETRIZATION AND SHAPE RECONSTRUCTION TECHNIQUES FOR DOO-SABIN SUBDIVISION SURFACES“. UKnowledge, 2008. http://uknowledge.uky.edu/gradschool_theses/509.
Der volle Inhalt der QuellePham-Trong, Valérie. „Détermination géométrique de chemins géodésiques sur des surfaces de subdivision“. Phd thesis, Université Joseph Fourier (Grenoble), 2001. http://www.theses.fr/2001GRE10112.
Der volle Inhalt der QuelleGeodesic paths between two points on a surface of R³ are local shortest paths. We propose two methods to compute them ; these ones are innovative because they use Computer Aided Geometric Design tools in this context of differential geometry. The minimisation method considers parametric surfaces and studies the problem in the parameter domain. Bezier and spline curves represent there the approximation class. Their control points are the variables for the minimization of the length of the image path on the surface. The implementation of this approximation method and its validation are developed. The subdivision method considers subdivision surfaces, limits of a sequence of control nets generated by a subdivision scheme. An iterative and exact method to compute geodesic paths on polyhedral surfaces is developed. This leads to the computation of a sequence of geodesic paths on the polyhedral surfaces associated to the successiv control nets. The convergence of the path sequence is discussed and we present results illustrated by examples. Some applications are finally given : surface mesh computation and myocardium fibres modelling in a medical context
Bücher zum Thema "Polyhedral subdivisions"
Divide spheres: Geodesics and the orderly subdivision of the sphere. Boca Raton: A K Peters/CRC Press, 2012.
Den vollen Inhalt der Quelle findenPopko, Edward S. Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere. CRC Press LLC, 2012.
Den vollen Inhalt der Quelle findenPopko, Edward S., und Christopher J. Kitrick. Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere. CRC Press LLC, 2021.
Den vollen Inhalt der Quelle findenPopko, Edward S., und Christopher J. Kitrick. Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere. CRC Press LLC, 2021.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Polyhedral subdivisions"
Yamaguchi, Fujio. „Polyhedron Subdivisions“. In Computer-Aided Geometric Design, 467–87. Tokyo: Springer Japan, 2002. http://dx.doi.org/10.1007/978-4-431-67881-6_21.
Der volle Inhalt der QuelleYamazaki, Shinji, Yoshihiro Yasumuro und Masahiko Fuyuki. „Adaptive Polyhedral Subdivision for Image-based Lighting“. In Service Robotics and Mechatronics, 177–82. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84882-694-6_31.
Der volle Inhalt der QuelleWarren, Joe, und Henrik Weimer. „Averaging Schemes for Polyhedral Meshes“. In Subdivision Methods for Geometric Design, 198–238. Elsevier, 2002. http://dx.doi.org/10.1016/b978-155860446-9/50009-0.
Der volle Inhalt der QuelleJonckheere, Edmond A. „Piecewise-Linear Nyquist Map“. In Algebraic and Differential Topology of Robust Stability, 113–23. Oxford University PressNew York, NY, 1997. http://dx.doi.org/10.1093/oso/9780195093018.003.0007.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Polyhedral subdivisions"
POSTNIKOV, ALEXANDER. „POSITIVE GRASSMANNIAN AND POLYHEDRAL SUBDIVISIONS“. In International Congress of Mathematicians 2018. WORLD SCIENTIFIC, 2019. http://dx.doi.org/10.1142/9789813272880_0177.
Der volle Inhalt der QuelleFortune, Steven. „Vertex-rounding a three-dimensional polyhedral subdivision“. In the fourteenth annual symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/276884.276897.
Der volle Inhalt der QuelleMount, D. „Storing the subdivision of a polyhedral surface“. In the second annual symposium. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/10515.10532.
Der volle Inhalt der QuelleZachmann, Gabriel. „Real-Time and Exact Collision Detection for Interactive Virtual Prototyping“. In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/cie-4306.
Der volle Inhalt der QuelleDejdumrong, Natasha. „The determination of surface intersection using subdivision and Polyhedron Intersection Methods“. In 2nd International Conference on Computer and Automation Engineering (ICCAE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccae.2010.5451590.
Der volle Inhalt der QuelleLiu, Ji-Bo, Zhi-Hong Wang und Yue-Guan Yan. „A method of three-dimensional subdivision of arbitrary polyhedron by using pyramids“. In 2016 5th International Conference on Measurement, Instrumentation and Automation (ICMIA 2016). Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icmia-16.2016.73.
Der volle Inhalt der QuelleSkala, Vaclav. „Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision“. In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2015 (ICNAAM 2015). Author(s), 2016. http://dx.doi.org/10.1063/1.4952270.
Der volle Inhalt der Quelle