subject:(Graph curvature)

Hong Kong University of Science and Technology

1. Wu, Fung Leung MATH. Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/1/th_redirect.html

► Combinatorial curvature is defined for polyhedral graphs analogue to Gaussian curvature for Riemannian 2-manifolds. Some aspects of polyhedral graphs from the perspective of combinatorial curvature… (more)

Subjects/Keywords: Graph theory ; Mathematical models ; Curvature ; Polyhedral functions ; Combinatorial geometry ; Geometry, Riemannian

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wu, F. L. M. (2019). Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wu, Fung Leung MATH. “Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed March 01, 2021. http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wu, Fung Leung MATH. “Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature.” 2019. Web. 01 Mar 2021.

Vancouver:

Wu FLM. Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Mar 01]. Available from: http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu FLM. Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

2. Wang, Zhiyu. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.

Degree: PhD, Mathematics, 2020, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/5771

► This thesis studies some problems in extremal and probabilistic combinatorics, Ricci curvature of graphs, spectral hypergraph theory and the interplay between these areas. The… (more)

▼ This thesis studies some problems in extremal and probabilistic combinatorics, Ricci curvature of graphs, spectral hypergraph theory and the interplay between these areas. The first main focus of this thesis is to investigate several Ramsey-type problems on graphs, hypergraphs and sequences using probabilistic, combinatorial, algorithmic and spectral techniques: The size-Ramsey number Rˆ(G, r) is defined as the minimum number of edges in a hypergraph H such that every r-edge-coloring of H contains a monochromatic copy of G in H. We improved a result of Dudek, La Fleur, Mubayi and Rödl [ J. Graph Theory 2017 ] on the size-Ramsey number of tight paths and extended it to more colors. An edge-colored graph G is called rainbow if every edge of G receives a different color. The anti-Ramsey number of t edge-disjoint rainbow spanning trees, denoted by r(n, t), is defined as the maximum number of colors in an edge-coloring of Kn containing no t edge-disjoint rainbow spanning trees. Confirming a conjecture of Jahanbekam and West [J. Graph Theory 2016], we determine the anti-Ramsey number of t edge-disjoint rainbow spanning trees for all values of n and t. We study the extremal problems on Berge hypergraphs. Given a graph G = (V, E), a hypergraph H is called a Berge-G, denoted by BG, if there exists an injection i ∶ V (G) → V (H) and a bijection f ∶ E(G) → E(H) such that for every e = uv ∈ E(G), (i(u), i(v)) ⊆ f(e). We investigate the hypergraph Ramsey number of Berge cliques, the cover-Ramsey number of Berge hypergraphs, the cover-Turán desity of Berge hypergraphs as well as Hamiltonian Berge cycles in 3-uniform hypergraphs. The second part of the thesis uses the ‘geometry’ of graphs to derive concentration inequalities in probabilities spaces. We prove an Azuma-Hoeffding-type inequality in several classical models of random configurations, including the Erdős-Rényi random graph models G(n, p) and G(n,M), the random d-out(in)-regular directed graphs, and the space of random permutations. The main idea is using Ollivier’s work on the Ricci curvature of Markov chairs on metric spaces. We give a cleaner form of such concentration inequality in graphs. Namely, we show that for any Lipschitz function f on any graph (equipped with an ergodic random walk and thus an invariant distribution ν) with Ricci curvature at least κ > 0, we have ν (∣f − Eνf∣ ≥ t) ≤ 2 exp (-t ²κ/7). The third part of this thesis studies a problem in spectral hypergraph theory, which is the interplay between graph theory and linear algebra. In particular, we study the maximum spectral radius of outerplanar 3-uniform hypergraphs. Given a hypergraph H, the shadow of H is a graph G with V (G) = V (H) and E(G) = {uv ∶ uv ∈ h for some h ∈ E(H)}. A 3-uniform hypergraph H is called outerplanar if its shadow is outerplanar and all faces except the outer face are triangles, and the edge set of H is the set of triangle faces of its shadow. We show that the outerplanar 3-uniform… Advisors/Committee Members: Linyuan Lu.

Subjects/Keywords: Mathematics; extremal combinatorics; graph theory; probabilistic methods; Ricci curvature; spectral hypergraph theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, Z. (2020). Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/5771

Chicago Manual of Style (16^th Edition):

Wang, Zhiyu. “Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.” 2020. Doctoral Dissertation, University of South Carolina. Accessed March 01, 2021. https://scholarcommons.sc.edu/etd/5771.

MLA Handbook (7^th Edition):

Wang, Zhiyu. “Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.” 2020. Web. 01 Mar 2021.

Vancouver:

Wang Z. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. [Internet] [Doctoral dissertation]. University of South Carolina; 2020. [cited 2021 Mar 01]. Available from: https://scholarcommons.sc.edu/etd/5771.

Council of Science Editors:

Wang Z. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. [Doctoral Dissertation]. University of South Carolina; 2020. Available from: https://scholarcommons.sc.edu/etd/5771

University of Minnesota

3. Farooq, Hamza. Geometric and Optimization Methods for Diffusion Magnetic Resonance Imaging.

Degree: PhD, Electrical/Computer Engineering, 2017, University of Minnesota

URL: http://hdl.handle.net/11299/216888

► This thesis presents novel mathematical and computational methods aimed at enhancing and improving brain tissue structural imaging techniques that are based on diffusion Magnetic Resonance… (more)

▼ This thesis presents novel mathematical and computational methods aimed at enhancing and improving brain tissue structural imaging techniques that are based on diffusion Magnetic Resonance Imaging (dMRI). The most commonly used dMRI technique is Diffusion Tensor Imaging (DTI), which models water diffusion via a Gaussian pattern and estimates the corresponding covariance, also known as diffusion tensor. DTI forms the basis of brain structural connectivity methods like tractography and sub-cortical region parcellation, and thus provides useful markers for brain white matter integrity. Other, recently proposed dMRI techniques rely on modeling water diffusion in intra-axonal and extra-axonal spaces separately. Thereby, these so-called multi-compartment models hold the promise to provide detailed tissue microstructure information and to identify markers that may be specific to particular tissue development/diseases. In this thesis we address key mathematical challenges encountered by DTI, as well as by these newly proposed dMRI techniques, that pertain to recovering more detailed microstructure information. We begin by focusing on DTI and present novel geometrical methods to improve DTI analysis (Chapters 3, 4, and 5). In particular, (i) we utilize the mathematical theory of Optimal Mass Transport to improve brain parcellation by comparing sub-cortical regions connectivity profiles and compute their corresponding geometric ``average'' connectivity profiles, (ii) we introduce Ricci flow applied to diffusion tensor fields to enhance feature extraction, and finally (iii) we introduce a notion of discrete Ricci curvature in brain connectivity networks as a novel nodal measure to detect critical regions (nodes) of the structural brain networks. This notion of node curvature can be used to identify changes in brain network structure due to disease/development as it supplements information that can be obtained by other conventional network nodal measures. We then study multi-compartment dMRI models, and present a novel model fitting method to such tissue models (Chapter 6). Our proposed method is generic to all multicompartment models and enables for the first time dMRI-imaging in multiple fiber orientations and fiber-crossings situations. In addition to potential improvements in imaging technology, we hope that the advances presented in this work will contribute to the diagnosis and treatment of neurological disorders.

Subjects/Keywords: Brain Networks; Diffusion MRI; Diffusion Tensor Imaging; Graph curvature; Micro-structure Imaging; Optimal Mass Transport

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Farooq, H. (2017). Geometric and Optimization Methods for Diffusion Magnetic Resonance Imaging. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/216888

Chicago Manual of Style (16^th Edition):

Farooq, Hamza. “Geometric and Optimization Methods for Diffusion Magnetic Resonance Imaging.” 2017. Doctoral Dissertation, University of Minnesota. Accessed March 01, 2021. http://hdl.handle.net/11299/216888.

MLA Handbook (7^th Edition):

Farooq, Hamza. “Geometric and Optimization Methods for Diffusion Magnetic Resonance Imaging.” 2017. Web. 01 Mar 2021.

Vancouver:

Farooq H. Geometric and Optimization Methods for Diffusion Magnetic Resonance Imaging. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/11299/216888.

Council of Science Editors:

Farooq H. Geometric and Optimization Methods for Diffusion Magnetic Resonance Imaging. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/216888

4. Nelsen, Lauren Morey. Applications of Geometric and Spectral Methods in Graph Theory.

Degree: PhD, Mathematics, 2019, U of Denver

URL: https://digitalcommons.du.edu/etd/1607

► Networks, or graphs, are useful for studying many things in today’s world. Graphs can be used to represent connections on social media, transportation networks,… (more)

Subjects/Keywords: Probabilistic method; Spectral graph theory; Graphs; Graph curvature; Geometry and Topology; Mathematics; Physical Sciences and Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nelsen, L. M. (2019). Applications of Geometric and Spectral Methods in Graph Theory. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1607

Chicago Manual of Style (16^th Edition):

Nelsen, Lauren Morey. “Applications of Geometric and Spectral Methods in Graph Theory.” 2019. Doctoral Dissertation, U of Denver. Accessed March 01, 2021. https://digitalcommons.du.edu/etd/1607.

MLA Handbook (7^th Edition):

Nelsen, Lauren Morey. “Applications of Geometric and Spectral Methods in Graph Theory.” 2019. Web. 01 Mar 2021.

Vancouver:

Nelsen LM. Applications of Geometric and Spectral Methods in Graph Theory. [Internet] [Doctoral dissertation]. U of Denver; 2019. [cited 2021 Mar 01]. Available from: https://digitalcommons.du.edu/etd/1607.

Council of Science Editors:

Nelsen LM. Applications of Geometric and Spectral Methods in Graph Theory. [Doctoral Dissertation]. U of Denver; 2019. Available from: https://digitalcommons.du.edu/etd/1607

5. Oldridge, Paul Richard. Characterizing the polyhedral graphs with positive combinatorial curvature.

Degree: Department of Computer Science, 2017, University of Victoria

URL: http://hdl.handle.net/1828/8030

► A polyhedral graph G is called PCC if every vertex of G has strictly positive combinatorial curvature and the graph is not a prism or… (more)

Subjects/Keywords: combinatorial curvature; positive combinatorial curvature; PCC; polyhedral graph; polyhedron

…conjectured that a graph which has every vertex with strictly positive curvature cannot be an… …graph is a prism. Since the curvature of a PCC graph sums to at most two, 3-regular PCC graphs… …curvature at a vertex in a PCC graph is at least 1 , 380 the curvature of a {4, 5, 19}… …CHAPTER 1 Introduction An undirected graph is an ordered pair G = (V, E), where V is… …and E(G) to denote the edge set of a graph G. A subgraph H of G is a graph where V…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oldridge, P. R. (2017). Characterizing the polyhedral graphs with positive combinatorial curvature. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/8030

Chicago Manual of Style (16^th Edition):

Oldridge, Paul Richard. “Characterizing the polyhedral graphs with positive combinatorial curvature.” 2017. Masters Thesis, University of Victoria. Accessed March 01, 2021. http://hdl.handle.net/1828/8030.

MLA Handbook (7^th Edition):

Oldridge, Paul Richard. “Characterizing the polyhedral graphs with positive combinatorial curvature.” 2017. Web. 01 Mar 2021.

Vancouver:

Oldridge PR. Characterizing the polyhedral graphs with positive combinatorial curvature. [Internet] [Masters thesis]. University of Victoria; 2017. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1828/8030.

Council of Science Editors:

Oldridge PR. Characterizing the polyhedral graphs with positive combinatorial curvature. [Masters Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/8030

Georgia Tech

6. Cowlagi, Raghvendra V. Hierarchical motion planning for autonomous aerial and terrestrial vehicles.

Degree: PhD, Aerospace Engineering, 2011, Georgia Tech

URL: http://hdl.handle.net/1853/41066

► Autonomous mobile robots - both aerial and terrestrial vehicles - have gained immense importance due to the broad spectrum of their potential military and civilian… (more)

▼ Autonomous mobile robots - both aerial and terrestrial vehicles - have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of the vehicular task requirements, which requires tools from combinatorics and/or formal methods, and (2) design of the vehicle control laws, which requires tools from dynamical systems and control theory. Accordingly, this problem is usually decomposed and solved over two levels of hierarchy. The higher level, called the geometric path planning level, finds a geometric path that satisfies the vehicular task requirements, e.g., obstacle avoidance. The lower level, called the trajectory planning level, involves sufficient smoothening of this geometric path followed by a suitable time parametrization to obtain a reference trajectory for the vehicle. Although simple and efficient, such hierarchical separation suffers a serious drawback: the geometric path planner has no information of the kinematic and dynamic constraints of the vehicle. Consequently, the geometric planner may produce paths that the trajectory planner cannot transform into a feasible reference trajectory. Two main ideas appear in the literature to remedy this problem: (a) randomized sampling-based planning, which eliminates altogether the geometric planner by planning in the vehicle state space, and (b) geometric planning supported by feedback control laws. The former class of methods suffer from a lack of optimality of the resultant trajectory, while the latter class of methods makes a restrictive assumption concerning the vehicle kinematic model. In this thesis, we propose a hierarchical motion planning framework based on a novel mode of interaction between these two levels of planning. This interaction rests on the solution of a special shortest-path problem on graphs, namely, one using costs defined on multiple edge transitions in the path instead of the usual single edge transition costs. These costs are provided by a local trajectory generation algorithm, which we implement using model predictive control and the concept of effective target sets for simplifying the non-convex constraints involved in the problem. The proposed motion planner ensures "consistency" between the two levels of planning, i.e., a guarantee that the higher level geometric path is always associated with a kinematically and dynamically feasible trajectory. We show that the proposed motion planning approach offers distinct advantages in comparison with the competing approaches of discretization of the state space, of randomized sampling-based motion planning, and of local… Advisors/Committee Members: Panagiotis Tsiotras (Committee Chair), Eric Feron (Committee Member), Magnus Egerstedt (Committee Member), Mark Costello (Committee Member), Mike Stilman (Committee Member).

Subjects/Keywords: Multi-resolution; Motion planning; Robotics; Vehicle dynamics; Graph search; Curvature bounded path planning; Autonomous vehicles; Mobile robots; Robots; Autonomous robots

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cowlagi, R. V. (2011). Hierarchical motion planning for autonomous aerial and terrestrial vehicles. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/41066

Chicago Manual of Style (16^th Edition):

Cowlagi, Raghvendra V. “Hierarchical motion planning for autonomous aerial and terrestrial vehicles.” 2011. Doctoral Dissertation, Georgia Tech. Accessed March 01, 2021. http://hdl.handle.net/1853/41066.

MLA Handbook (7^th Edition):

Cowlagi, Raghvendra V. “Hierarchical motion planning for autonomous aerial and terrestrial vehicles.” 2011. Web. 01 Mar 2021.

Vancouver:

Cowlagi RV. Hierarchical motion planning for autonomous aerial and terrestrial vehicles. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1853/41066.

Council of Science Editors:

Cowlagi RV. Hierarchical motion planning for autonomous aerial and terrestrial vehicles. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/41066

Pontifical Catholic University of Rio de Janeiro

7. [No author]. [pt] ASPECTOS GEOMÉTRICOS DE POLIGONAIS GENÉRICAS: CURVATURA TOTAL E CONVEXIDADE.

Degree: 2020, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49597

►

[pt] O objetivo deste trabalho é o de estudar propriedades geométricas de curvas poligonais genéricas. Inicialmente abordamos resultados clássicos para curvas quanto à sua curvatura… (more)

Subjects/Keywords: [pt] POLIGONAIS GENERICAS; [pt] GRAFO DE MAXWELL; [pt] CURVATURA TOTAL; [en] GENERIC POLYGONAL LINES; [en] MAXWELL GRAPH; [en] TOTAL CURVATURE

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

author], [. (2020). [pt] ASPECTOS GEOMÉTRICOS DE POLIGONAIS GENÉRICAS: CURVATURA TOTAL E CONVEXIDADE. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49597

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

author], [No. “[pt] ASPECTOS GEOMÉTRICOS DE POLIGONAIS GENÉRICAS: CURVATURA TOTAL E CONVEXIDADE.” 2020. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 01, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49597.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

author], [No. “[pt] ASPECTOS GEOMÉTRICOS DE POLIGONAIS GENÉRICAS: CURVATURA TOTAL E CONVEXIDADE.” 2020. Web. 01 Mar 2021.

Vancouver:

author] [. [pt] ASPECTOS GEOMÉTRICOS DE POLIGONAIS GENÉRICAS: CURVATURA TOTAL E CONVEXIDADE. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2020. [cited 2021 Mar 01]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49597.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

author] [. [pt] ASPECTOS GEOMÉTRICOS DE POLIGONAIS GENÉRICAS: CURVATURA TOTAL E CONVEXIDADE. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2020. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=49597

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

8. Hulík, Rostislav. Detekce zubů na 3D počítačovém polygonálním modelu čelisti: Tooth Detection on Jaw 3D Computer Polygonal Model.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/52935

► This document discusses a concept and implementation of algorithms for teeth detection on 3D polygonal jaw model. At first, I describe possible shape detection techniques… (more)

Subjects/Keywords: detekce; zuby; 3D; model; polygonální; čelist; křivost; střední; Gaussova; minimální; maximální; vyhlazení; Laplace; Watershed; filtr; MDSTk; Open Scene Graph; MS Visual Studio 2005; Detection; tooth; teeth; 3D; model; polygonal; jaw; curvature; mean; Gauss; minimal; maximal; smoothing; Laplace; watershed; filtration; MDSTk; Open Scene Graph; MS Visual Studio 2005

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hulík, R. (2018). Detekce zubů na 3D počítačovém polygonálním modelu čelisti: Tooth Detection on Jaw 3D Computer Polygonal Model. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hulík, Rostislav. “Detekce zubů na 3D počítačovém polygonálním modelu čelisti: Tooth Detection on Jaw 3D Computer Polygonal Model.” 2018. Thesis, Brno University of Technology. Accessed March 01, 2021. http://hdl.handle.net/11012/52935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hulík, Rostislav. “Detekce zubů na 3D počítačovém polygonálním modelu čelisti: Tooth Detection on Jaw 3D Computer Polygonal Model.” 2018. Web. 01 Mar 2021.

Vancouver:

Hulík R. Detekce zubů na 3D počítačovém polygonálním modelu čelisti: Tooth Detection on Jaw 3D Computer Polygonal Model. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/11012/52935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hulík R. Detekce zubů na 3D počítačovém polygonálním modelu čelisti: Tooth Detection on Jaw 3D Computer Polygonal Model. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/52935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Nicol, Andrew. Quasi-isometries of graph manifolds do not preserve non-positive curvature.

Degree: PhD, Mathematics, 2014, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1405894640

► Continuing the work of Frigerio, Lafont, and Sisto, we recall the definition of high dimensional graph manifolds. They are compact, smooth manifolds which decompose into… (more)

Subjects/Keywords: Mathematics; graph manifolds; geometric group theory; quasi-isometries; non-positive curvature; bounded cohomology; relative hyperbolicity; isolated flats

…following Theorem 1.1. There exists infinitely many examples of pairs of graph manifolds with… …8]: Problem 1.2. Is there a pair of irreducible graph manifolds with quasi-isometric… …progress on this question for the classical definition of graph manifold following the work of… …can find a pair of graph manifolds with quasi-isometric fundamental groups with the property… …necessary definitions. These will include the background material on graph manifolds, group…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nicol, A. (2014). Quasi-isometries of graph manifolds do not preserve non-positive curvature. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1405894640

Chicago Manual of Style (16^th Edition):

Nicol, Andrew. “Quasi-isometries of graph manifolds do not preserve non-positive curvature.” 2014. Doctoral Dissertation, The Ohio State University. Accessed March 01, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1405894640.

MLA Handbook (7^th Edition):

Nicol, Andrew. “Quasi-isometries of graph manifolds do not preserve non-positive curvature.” 2014. Web. 01 Mar 2021.

Vancouver:

Nicol A. Quasi-isometries of graph manifolds do not preserve non-positive curvature. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2021 Mar 01]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1405894640.

Council of Science Editors:

Nicol A. Quasi-isometries of graph manifolds do not preserve non-positive curvature. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1405894640

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations