Relevant bibliographies by topics / Geodesic distances

Contents

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

Academic literature on the topic 'Geodesic distances'

Author: Grafiati
Published: 14 December 2024
Last updated: 11 January 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 'Geodesic distances.'

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 "Geodesic distances"

1

Li, Yue, Logan Numerow, Bernhard Thomaszewski, and Stelian Coros. "Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes." ACM Transactions on Graphics 43, no. 4 (2024): 1–14. http://dx.doi.org/10.1145/3658122.

Full text
Abstract:
Computing intrinsic distances on discrete surfaces is at the heart of many minimization problems in geometry processing and beyond. Solving these problems is extremely challenging as it demands the computation of on-surface distances along with their derivatives. We present a novel approach for intrinsic minimization of distance-based objectives defined on triangle meshes. Using a variational formulation of shortest-path geodesics, we compute first and second-order distance derivatives based on the implicit function theorem, thus opening the door to efficient Newton-type minimization solvers. We demonstrate our differentiable geodesic distance framework on a wide range of examples, including geodesic networks and membranes on surfaces of arbitrary genus, two-way coupling between hosting surface and embedded system, differentiable geodesic Voronoi diagrams, and efficient computation of Karcher means on complex shapes. Our analysis shows that second-order descent methods based on our differentiable geodesics outperform existing first-order and quasi-Newton methods by large margins.
APA, Harvard, Vancouver, ISO, and other styles
2

Guzmán Naranjo, Matías, and Gerhard Jäger. "Euclide, the crow, the wolf and the pedestrian: distance metrics for linguistic typology." Open Research Europe 3 (June 21, 2023): 104. http://dx.doi.org/10.12688/openreseurope.16141.1.

Full text
Abstract:
It is common for people working on linguistic geography, language contact and typology to make use of some type of distance metric between lects. However, most work so far has either used Euclidean distances, or geodesic distance, both of which do not represent the real separation between communities very accurately. This paper presents two datasets: one on walking distances and one on topographic distances between over 8700 lects across all macro-areas. We calculated walking distances using Open Street Maps data, and topographic distances using digital elevation data. We evaluate these distances. We evaluate these distance metrics on three case studies and show that topographic distance tends to outperform the other distance metrics, but geodesic distances can be used as an adequate approximation in some cases.
APA, Harvard, Vancouver, ISO, and other styles
3

Mejia-Parra, Daniel, Jairo R. Sánchez, Jorge Posada, Oscar Ruiz-Salguero, and Carlos Cadavid. "Quasi-Isometric Mesh Parameterization Using Heat-Based Geodesics and Poisson Surface Fills." Mathematics 7, no. 8 (2019): 753. http://dx.doi.org/10.3390/math7080753.

Full text
Abstract:
In the context of CAD, CAM, CAE, and reverse engineering, the problem of mesh parameterization is a central process. Mesh parameterization implies the computation of a bijective map ϕ from the original mesh M ∈ R 3 to the planar domain ϕ ( M ) ∈ R 2 . The mapping may preserve angles, areas, or distances. Distance-preserving parameterizations (i.e., isometries) are obviously attractive. However, geodesic-based isometries present limitations when the mesh has concave or disconnected boundary (i.e., holes). Recent advances in computing geodesic maps using the heat equation in 2-manifolds motivate us to revisit mesh parameterization with geodesic maps. We devise a Poisson surface underlying, extending, and filling the holes of the mesh M. We compute a near-isometric mapping for quasi-developable meshes by using geodesic maps based on heat propagation. Our method: (1) Precomputes a set of temperature maps (heat kernels) on the mesh; (2) estimates the geodesic distances along the piecewise linear surface by using the temperature maps; and (3) uses multidimensional scaling (MDS) to acquire the 2D coordinates that minimize the difference between geodesic distances on M and Euclidean distances on R 2 . This novel heat-geodesic parameterization is successfully tested with several concave and/or punctured surfaces, obtaining bijective low-distortion parameterizations. Failures are registered in nonsegmented, highly nondevelopable meshes (such as seam meshes). These cases are the goal of future endeavors.
APA, Harvard, Vancouver, ISO, and other styles
4

WANG, SONGJING, ZHOUYU YU, and LIFENG XI. "AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS." Fractals 25, no. 05 (2017): 1750044. http://dx.doi.org/10.1142/s0218348x1750044x.

Full text
Abstract:
The average geodesic distance is concerned with complex networks. To obtain the limit of average geodesic distances on growing Sierpinski networks, we obtain the accurate value of integral in terms of average geodesic distance and self-similar measure on the Sierpinski gasket. To provide the value of integral, we find the phenomenon of finite pattern on integral inspired by the concept of finite type on self-similar sets with overlaps.
APA, Harvard, Vancouver, ISO, and other styles
5

Jenčová, Anna. "Geodesic distances on density matrices." Journal of Mathematical Physics 45, no. 5 (2004): 1787–94. http://dx.doi.org/10.1063/1.1689000.

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

Guzmán Naranjo, Matías, and Gerhard Jäger. "Euclide, the crow, the wolf and the pedestrian: distance metrics for linguistic typology." Open Research Europe 3 (July 2, 2024): 104. http://dx.doi.org/10.12688/openreseurope.16141.2.

Full text
Abstract:
It is common for people working on linguistic geography, language contact and typology to make use of some type of distance metric between lects. However, most work so far has either used Euclidean distances, or geodesic distance, both of which do not represent the real separation between communities very accurately. This paper presents two datasets: one on walking distances and one on topographic distances between over 8700 lects across all macro-areas. We calculated walking distances using Open Street Maps data, and topographic distances using digital elevation data. We evaluate these distance metrics on three case studies and show that from the four distances, the topographic and geodesic distances showed the most consistent performance across datasets, and would be likely to be reasonable first choices. At the same time, in most cases, the Euclidean distances were not much worse than the other distances, and might be a good enough approximation in cases for which performance is critical, or the dataset cover very large areas, and the point-location information is not very precise.
APA, Harvard, Vancouver, ISO, and other styles
7

BORGELT, MAGDALENE G., MARC VAN KREVELD, and JUN LUO. "GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON." International Journal of Computational Geometry & Applications 21, no. 06 (2011): 595–608. http://dx.doi.org/10.1142/s0218195911003822.

Full text
Abstract:
Let P be a simple polygon of n vertices and let S be a set of N points lying in the interior of P. A geodesic diskGD(p,r) with center p and radius r is the set of points in P that have a geodesic distance ≤ r from p (where the geodesic distance is the length of the shortest polygonal path connection that lies in P). In this paper we present an output sensitive algorithm for finding all N geodesic disks centered at the points of S, for a given value of r. Our algorithm runs in [Formula: see text] time, for some constant c and output size k. It is the basis of a cluster reporting algorithm where geodesic distances are used.
APA, Harvard, Vancouver, ISO, and other styles
8

Hino, Masanori. "Geodesic Distances and Intrinsic Distances on Some Fractal Sets." Publications of the Research Institute for Mathematical Sciences 50, no. 2 (2014): 181–205. http://dx.doi.org/10.4171/prims/129.

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

Mahdi, Hussein Alwan. "A MODIFIED METHOD FOR DETERMINATION OF SCALE FACTOR OF THE PROJECTED GEODESIC." Journal of Engineering 12, no. 03 (2006): 882–95. http://dx.doi.org/10.31026/j.eng.2006.03.31.

Full text
Abstract:
Conformal projection is one of the most important aspects that geodesy dealing with. Thedetermination of the scale factors in the meridian, the parallel and projected geodesic directions are thefinal result of the conformal projection. Methods for determining the scale factors in the meridian andthe parallel directions have a quite sufficient accuracy. While methods for determining the projectedgeodesic have different accuracy and computation complicity.This research adopts a modified method for computing the exact value of scale factor ingeodesic direction. In this method the scale factor is obtained by determining the true and projecteddistances of the geodetic line. In the traditional methods for determining the projected distance it isusual to use the 1/3 Simpson's rule in the computations while the modified method the 3/8 Simpson'srule is used.Computations and mathematical tests were carried out to obtain the scale factors using thetraditional methods and comparison was made with modified method.By applying the developed method and the traditional methods to calculate the scale factor, it wasfound that the modified method is more accurate and the projected distances can be obtained exactly.
APA, Harvard, Vancouver, ISO, and other styles
10

Noyel, Guillaume, Jesús Angulo, and Dominique Jeulin. "FAST COMPUTATION OF ALL PAIRS OF GEODESIC DISTANCES." Image Analysis & Stereology 30, no. 2 (2011): 101. http://dx.doi.org/10.5566/ias.v30.p101-109.

Full text
Abstract:
Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show that our method in which the source point of geodesic propagations is chosen according to its minimum number of distances to the other points, improves the previous method up to 32 % and the naive method up to 50 % in terms of reduction of the number of operations.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Geodesic distances"

1

Oliveira, Guilherme do Nascimento. "Procedural textures mapping using geodesic distances." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2011. http://hdl.handle.net/10183/34767.

Full text
Abstract:
O mapeamento de texturas é uma técnica bastante importante para adicionar detalhamento a modelos geométricos. O mapeamento de texturas baseadas em imagens costuma ser a abordagem preferida, mas faz uso de imagens pré-computadas que são mais adequadas à representação de padrões estáticos. Por outro lado, texturas procedurais oferecem uma alternativa que depende de funções para descrever os padrões das texturas. Elas garantem mais flexibilidade na definição dos padrões em cenas dinâmicas, tendo ainda uma representação mais compacta e dando um maior controle da aparência da textura através do ajuste de parâmetros. Quando mapeadas por coordenadas 3D, as texturas procedurais não consideram a forma da superfície domodelo, e com coordenadas 2D torna-se necessária a definição dessas coordenadas de forma coerente, que, em modelos complexos ,não é uma tarefa simples. Neste trabalho nós introduzimos o leitor às texturas procedurais e ao mapeamento de texturas, então apresentamos GeoTextures, uma nova abordagem que faz uso de distâncias geodésicas definidas com base em múltiplos pontos de origem sobre a superfície do modelo. As distâncias geodésicas são passadas como parâmetros que permitem que a textura procedural se adeqüe ao relevo do modelo texturizado. Nós validamos a proposta ao usar alguns exemplos de texturas procedurais aplicadas em tempo real na texturização de superfícies complexas, mudando tanto a textura do modelo como a forma, através do uso de tesselagem em hardware.<br>Texture mapping is an important technique to add detail to geometric models. Imagebased texture mapping is the preferred approach but employs pre-computed images, which are better suited for static patterns. On the other hand, procedural-based texture mapping offers an alternative that rely on functions to describe texturing patterns. This allows more flexibility to define patterns in dynamic scenes, while also having a more compact representation and more control for parametric adjustments on the texture visual appearance. When mapped with 3D coordinates, the procedural textures do not consider the model surface, and with 2D mapping the coordinates must be defined in a coherent way, which for complex models is not an easy task. In this work we give a introduction to procedural texturing and texture mapping, and introduce GeoTextures, an original approach that uses geodesic distance defined from multiple sources at different locations over the surface of the model. The geodesic distance is passed as a parameter that allows the shape of the model to be considered in the definition of the procedural texture. We validate the proposal using procedural textures that are applied in real-time to complex surfaces, and show examples that change both the shading of the models, as well as their shape using hardware-based tessellation.
APA, Harvard, Vancouver, ISO, and other styles
2

Bertrand, Théo. "Méthodes géodésiques et apprentissage pour l’imagerie de microscopie par localisation ultrasonore." Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD024.

Full text
Abstract:
La méthode de Microscopie par Localisation Ultrasonore (ULM) est une nouvelle méthode d'imagerie médicale super-résolue qui permet d'outrepasser le compromis précision/distance de pénétration dans les tissus pour l'imagerie du réseau vasculaire. Ce nouveau type d'images pose de nouveaux enjeux mathématiques, notamment pour la segmentation et l'analyse de ses images, étapes nécessaires pour arriver à des méthodes pour le diagnostic. Notre travail se positionne à l'intersection des méthodes géodésiques et des méthodes de Machine Learning. Dans cette thèse nous apportons trois contributions. Une première de ces contributions est centrée autour des contraintes liées aux images ULM et propose le tracking de l'entièreté de l'arbre vasculaire en passant par la détection des point-clés des vaisseaux sanguins apparaissant sur l'image. La deuxième contribution de cette thèse porte sur l'apprentissage de la définition de métriques Riemanniennes pour traiter des tâches de segmentation sur des données d'IRM cérébraux et d'images du fond de l'œil. La dernière partie de notre travail porte sur un problème inverse pour la reconstruction de trajectoires d'agents de contraste dans des images médicales dans le contexte de la super-résolution sans-grille<br>Ultrasound Localization Microscopy is a new method in super-resolved Medical Imaging that allow us to overcome compromise between precision and penetration distance in the tissues for the imaging of the vascular network. This new type of images raises new mathematical questions, especially for the segmentaton and analysis, necessary steps to achieve medical diagnostic of patients. Our work is positioned at the intersection of geodesic and Machine Learning methods. In this thesis, we make three contributions. The first of these is centered on the constraints linked to ULM images and proposes the tracking of the entire vascular tree through the detection of key points of blood vessels appearing on the image. The second contribution of this thesis deals with learning to define Riemannian metrics to handle segmentation tasks on brain MRI data and eye fundus images. The final part of our work focuses on an inverse problem for reconstructing contrast agent trajectories in medical images in the context of grid-free super-resolution
APA, Harvard, Vancouver, ISO, and other styles
3

Makaroff, Nicolas. "Segmentation by deep learning with geometric constraints and active contours." Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD030.

Full text
Abstract:
La segmentation des images médicales est une tâche critique dans la pratique clinique, nécessitant des méthodes précises et fiables pour aider au diagnostic et à la planification du traitement. Cependant, les approches d'apprentissage profond existantes manquent souvent d'interprétabilité et de robustesse, ce qui limite leur application dans des environnements cliniques sensibles. Cette thèse aborde ces défis en proposant deux nouveaux modèles d'apprentissage profond qui intègrent des techniques classiques de traitement d'images pour améliorer la performance et la fiabilité de la segmentation. La première contribution, le Chan-Vese Attention U-Net, incorpore un mécanisme d'attention basé sur la minimisation de l'énergie de Chan-Vese dans l'architecture U-Net. Cette approche exploite les contraintes géométriques pour guider le processus de segmentation, ce qui permet au modèle de produire des résultats plus précis et plus faciles à interpréter en se concentrant sur les régions pertinentes de l'image et en minimisant les détails non pertinents. La seconde contribution, le Fast Marching Energy CNN, combine les réseaux neuronaux avec le calcul de la distance géodésique pour apprendre les métriques riemanniennes isotropes directement à partir des données, ce qui permet de générer des masques de segmentation robustes qui conservent à la fois les propriétés géométriques et topologiques. Ces méthodes utilisent des transformées de distance différentiables et l'algorithme de marche sous-gradient pour les intégrer dans un cadre différentiables. En intégrant les techniques traditionnelles de minimisation de l'énergie aux modèles modernes d'apprentissage profond, cette recherche fait progresser le domaine de l'analyse d'images médicales, en offrant des outils plus fiables et interprétables pour la segmentation automatisée. Les résultats de cette thèse ont le potentiel d'améliorer les processus de prise de décision clinique et l'adoption de solutions pilotées par l'IA dans les soins de santé<br>Segmentation of medical images is crucial in clinical practice, requiring accurate and reliable methods to aid diagnosis and treatment planning. However, existing deep learning approaches often need more interpretability and robustness, limiting their application in sensitive clinical environments. This thesis addresses these challenges by proposing two new deep learning models integrating classical image processing techniques to improve segmentation performance and reliability. The first contribution, the Chan-Vese Attention U-Net, incorporates an attention mechanism based on Chan-Vese energy minimisation into the U-Net architecture. This approach exploits geometric constraints to guide the segmentation process, enabling the model to produce more accurate and easier-to-interpret results by focusing on relevant regions of the image and minimising irrelevant details. The second contribution, Fast Marching Energy CNN, combines neural networks with geodesic distance computation to learn isotropic Riemannian metrics directly from the data, generating robust segmentation masks that preserve geometric and topological properties. These methods integrate differentiable distance transforms and the subgradient walk algorithm into a differentiable framework. By integrating traditional energy minimisation techniques with modern deep learning models, this research advances the field of medical image analysis, providing more reliable and interpretable tools for automated segmentation. The results of this thesis can potentially improve clinical decision-making processes and the adoption of AI-driven solutions in healthcare
APA, Harvard, Vancouver, ISO, and other styles
4

Nilsson, Ola. "Level-set methods and geodesic distance functions /." Norrköping : Department of Science and Technology, Linköping University, 2009. http://www.bibl.liu.se/liupubl/disp/disp2009/tek1275s.pdf.

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

Wang, Rui, and 王睿. "Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48330139.

Full text
Abstract:
The medial axis is an important shape representation and the computation of the medial axis is a fundamental research problem in computer graphics. Practically, the medial axis is widely used in various aspects of computer graphics, such as shape analysis, image segmentation, skeleton extraction and mesh generation and so forth. However, the applications of the medial axis have been limited by its sensitivity to boundary perturbations. This characteristic may lead to a number of noise branches and increase the complexity of the medial axis. To solve the sensitivity problem, it is critical to simplify the medial axis. This thesis first investigates the algorithms for computing medial axes of different input shapes. Several algorithms for the filtration of medial axes are then reviewed, such as the local importance measurement algorithms, boundary smoothness algorithms, and the global algorithms. Two novel algorithms for the simplification of the medial axis are proposed to generate a stable and simplified medial axis as well as its reconstructed boundary. The developed Global Geodesic Slope(GGS) algorithm for the medial axis simplification is based on the global geodesic slope defined in this thesis, which combines the advantages of the global and the local algorithms. The GGS algorithm prunes the medial axis according to local features as well as the relative size of the shape. It is less sensitive to boundary noises than the local algorithms, and can maintain the features of the shape in highly concave regions while the global algorithms may not. The other simplification algorithm we propose is the Accumulated Hyperbolic Distance(AHD) algorithm. It directly uses the evaluation criterion of the error, accumulated hyperbolic distance defined in this thesis, as the pruning measurement in the filtration process. It guarantees the upper bound of the error between the reconstructed shape and the original one within the defined threshold. The AHD algorithm avoids sudden changes of the reconstructed shape as the defined threshold changes.<br>published_or_final_version<br>Computer Science<br>Master<br>Master of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
6

Lu, Shi-Jian. "The significance of atmospheric effects in electronic distance measurement." Thesis, University of Leeds, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278369.

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

Brandão, Artur Caldas. "Possibilidade de emprego de um campo de pontos planimetrico como definidor de um comparador de distancias colineares." reponame:Repositório Institucional da UFPR, 1996. http://hdl.handle.net/1884/48609.

Full text
Abstract:
Orientador: Quintino Dalmolin<br>Co-orientador: Tarcisio Ferreira Silva<br>Dissertação (mestrado) - Universidade Federal do Paraná<br>Resumo: O procedimento clássico usado para determinar as distâncias interpilares de uma linha base multipilar para calibração de distanciômetros, consiste em avaliar essas distâncias diretamente, usando equipamentos de alta precisão. Nesse caso, a precisão final das distâncias interpilares fica limitada à precisão do próprio equipamento usado. Neste trabalho, foi desenvolvido um procedimento metodológico para definir as distâncias interpilares de uma linha base a partir de um campo de pontos planimétrico, em que os pontos da linha base foram incluídos. Para tanto, a configuração geométrica do campo de pontos foi adequadamente otimizada através de procedimentos de simulação. Garantiu-se assim que os resultados esperados para a precisão final dos pontos da rede fossem obtidos antes mesmo do trabalho de campo ser conduzido. O programa "NETZ2D" de análise e ajustamento de redes 2D foi usado como ferramenta computacional. Os experimentos realizados no processo de simulação e de medição do campo de pontos, foram conduzidos sobre a linha base da UFPE. Na medição do campo de pontos otimizado, garantiu-se o controle do processo de medição em termos de escolha adequada do período de medição e dos equipamentos. Verificou-se que a metodologia proposta, quando comparado ao procedimento clássico, apresentou vantagens em termos de facilidades de implementação bem como nos resultados obtidos. No experimento realizado, as distâncias interpilares da linha base da UFPE foram definidas com uma precisão cinco vezes maior que a precisão das medidas de distâncias avaliadas no campo de pontos. Por outro lado, resultado final equivalente foi obtido para os pontos da linha base simulando um campo de pontos com um único padrão metrológico de distância.<br>Abstract: The used classic proceeding to determine the interpillares distancies of one multipillar base line to calibration of eletronic distancies measuring (EDM), consist in to evaluate this distancies directing using equipmenty of high precision. In this case, the finish precision of the interpillares distancies stay limited the precision of proper equipment used. In this work, was developed a metodologic proceeding to define the interpillares distancies of one base line until of the network 2D, in that the points of base line was incluids. To that effect, the geometric configuration of network 2D was adequatement optimized through of proceeding of simulation. Was guaranted that the hoped results to the finish precision of the points of the net have was obtain before the work of field to be conduzed. The program "NETZ2D" of analysis and adjustment of the nets was used how computation instrument. The experiments realized in the simulation and measure process of the network, was conduzed about the base line of UFPE. On the measuring of network optmized, was guaranty the control of the measuring process adequad choose of the time of the measuring and of the equipments. Was verified that the offered metodology, when compared to the classic proceeding, showed advantagies of easilies implementation, as in the results obtained. On the experiment realized, the interpillares distancies of base line of the UFPE was define with one precision five time bigger than the precision o f the measure of the distancies evaluated on network. On the other hand, the equivalent finish result was obtained to the points of the base line, simulating one network with only one standart metrologic of the distance.
APA, Harvard, Vancouver, ISO, and other styles
8

Kohli, Mathieu. "De la notion de courbure géodésique en géométrie sous-Riemannienne." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLX043/document.

Full text
Abstract:
Dans cette thèse, on présente une notion de courbure géodésique pour les courbes lisses horizontales dans une variété sous-Riemannienne de contact, qui indique dans quelle mesure une courbe est différente d'une géodésique. Cette courbure géodésique se présente sous la forme de deux fonctions qui sont toutes deux identiquement nulles le long d'une courbe lisse horizontale si et seulement si cette dernière courbe est une géodésique. Le résultat principal de cette thèse réside dans l'interprétation métrique que l'on donne de ces fonctions de courbure. Cette interprétation consiste à extraire la courbure géodésique des premiers termes de correction dans le développement limité de la distance sous-Riemannienne entre deux points proches le long de la courbe<br>We present a notion of geodesic curvature for smooth horizontal curves in a contact sub-Riemannian manifold, measuring how far a horizontal curve is from being a geodesic. This geodesic curvature consists in two functions that both vanish along a smooth horizontal curve if and only if this curve is a geodesic. The main result of this thesis is the metric interpretation of these geodesic curvature functions. This interpretation consists in seeing the geodesic curvature functions as the first corrective coefficients in the Taylor expansion of the sub-Riemannian distance between two close points on the curve
APA, Harvard, Vancouver, ISO, and other styles
9

Arcostanzo, Marc. "Rigidité et prolongement au disque d'une distance sur le bord." Université Joseph Fourier (Grenoble), 1994. http://www.theses.fr/1994GRE10216.

Full text
Abstract:
Etant donne une distance d sur le bord d'un disque de dimension deux, nous cherchons dans cette these a prolonger d en une distance sur le disque tout entier, de telle sorte que l'espace metrique obtenu soit un espace de longueur, par exemple une metrique riemannienne ou finslerienne. Le prolongement est dit rigide s'il est unique a isometrie pres. Des resultats de rigidite ont ete obtenus par r. Michel, j. P. Otal et c. B. Croke en se restreignant aux metriques riemanniennes. Nous prouvons ici la rigidite des metriques euclidiennes a singularites coniques de courbures negatives. Nous donnons egalement des exemples de metriques riemanniennes non rigides. Nous montrons ensuite qu'un tel prolongement est entierement determine par la donnee de ses courbes geodesiques, ce qui permet de decrire l'ensemble des solutions du probleme. En imposant des conditions sur la distance sur le bord et le systeme de geodesiques, l'espace de longueur obtenu provient en fait d'une metrique finslerienne ou riemannienne. On obtient finalement un critere pour que deux prolongements ne soient pas isometriques
APA, Harvard, Vancouver, ISO, and other styles
10

Miller, Charles Miller. "THE EFFECT OF DISTANCE DECAY: A STUDY OF AUTOMOTIVE RETAILING." Diss., Temple University Libraries, 2017. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/439401.

Full text
Abstract:
Business Administration/Interdisciplinary<br>D.B.A.<br>Retail automotive literature that examines how the distance between a retail automotive facility and the prospective purchaser affects market performance is limited. Primary data for this study indicates that distance and purchase in the retail automotive sector move in opposite directions. This study examines similar goods that have high barriers of entry and proposes other methods of increasing market reach. This is a study of the conditions that affect the market performance for imported luxury vehicles. First, is the effect of distance on purchase decisions. Vehicular sales drop the further away a customer is from a car dealership. We call this phenomenon distance decay. Distance decay is defined as: the interaction between two locations declines as the distance between then increases. Secondly, when similar brands are viewed as substitutes, the consumer will choose the brand with the closest automotive service department to their residence or place of employment. Thirdly, door-to-door selling can decrease distance decay. Lastly, pick-up and delivery service can decrease distance decay. Data from 30,936 prospects and individuals who entered, phoned, or emailed a dealership inquiring about purchasing a new Audi were used in the study. These prospects will be categorized by who intended to buy and who actually purchased a car. In addition to the prospects, data from 6,153 individuals who purchased a new Audi from four Audi dealerships in the greater Philadelphia area and from the framed field experiment were used in the study. These categories will then be further labeled by ZIP code and city to determine the effects of distance. Then, possible solutions will be performed on test groups to determine what alternatives from other industries can be used to improve market performance involving long distances.<br>Temple University--Theses
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Geodesic distances"

1

Kravchenko, Yuriy. Surveying. INFRA-M Academic Publishing LLC., 2017. http://dx.doi.org/10.12737/textbook_5900a29b032774.83960082.

Full text
Abstract:
The contents of the book corre-sponds to the curriculum of surveying for building schools. Including historical and general information about on geodesy, the basic principles of treatment results of geodetic measurements, information about topographic maps and plans and solutions the problems with their use, description of instruments and methods of measurement of angles, distances and excesses on the earth surface, information about horizontal and vertical geo-detic networks, methods for creat-ing and processing survey geodes-ic networks, types and methods of survey, a description of the meth-ods removal projects in nature, description of the geodetic works in prospecting, designing and con-struction of objects capital con-struction.
APA, Harvard, Vancouver, ISO, and other styles
2

Rüeger, J. M. Electronic distance measurement: An introduction. 3rd ed. Springer-Verlag, 1990.

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

Rüeger, J. M. Electronic distance measurement: An introduction. 3rd ed. Springer-Verlag, 1990.

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

Rüeger, J. M. Electronic distance measurement: An introduction. 3rd ed. Springer-Verlag, 1990.

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

Rüeger, J. M. Electronic distance measurement: An introduction. 4th ed. Springer, 1996.

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

Guoqiang, Tang. Studies of extragalactic radio source structure and its effect on geodetic VLBI measurement. School of Electrical and Computer Engineering, Chalmers University of Technology, 1988.

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

Elements of Plane and Spherical Trigonometry: With Their Applications to Heights and Distances Projections of the Sphere, Dialling, Astronomy, the Solution of Equations, and Geodesic Operations. Creative Media Partners, LLC, 2023.

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

Rüeger, Jean M. Electronic Distance Measurement: An Introduction. Springer London, Limited, 2012.

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

Rüeger, Jean M. Electronic Distance Measurement: An Introduction. 4th ed. Springer, 1996.

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

Rueger, Jean M. Electronic Distance Measurement: An Introduction. Springer-Verlag, 1991.

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

Book chapters on the topic "Geodesic distances"

1

Aiello, Rosario, Francesco Banterle, Nico Pietroni, Luigi Malomo, Paolo Cignoni, and Roberto Scopigno. "Compression and Querying of Arbitrary Geodesic Distances." In Image Analysis and Processing — ICIAP 2015. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23231-7_26.

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

Aflalo, Yonathan, and Ron Kimmel. "Measuring Geodesic Distances via the Uniformization Theorem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-24785-9_40.

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

Berretti, S., A. Del Bimbo, P. Pala, and F. J. Silva Mata. "Face Recognition by Matching 2D and 3D Geodesic Distances." In Multimedia Content Analysis and Mining. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73417-8_53.

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

Soille, Pierre. "Generalized Geodesic Distances Applied to Interpolation and Shape Description." In Computational Imaging and Vision. Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1040-2_25.

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

Handrich, Sebastian, and Ayoub Al-Hamadi. "Upper-Body Pose Estimation Using Geodesic Distances and Skin-Color." In Advanced Concepts for Intelligent Vision Systems. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02895-8_14.

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

Estévez, Pablo A., Andrés M. Chong, Claudio M. Held, and Claudio A. Perez. "Nonlinear Projection Using Geodesic Distances and the Neural Gas Network." In Artificial Neural Networks – ICANN 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11840817_49.

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

Datar, Manasi, Ilwoo Lyu, SunHyung Kim, Joshua Cates, Martin A. Styner, and Ross Whitaker. "Geodesic Distances to Landmarks for Dense Correspondence on Ensembles of Complex Shapes." In Advanced Information Systems Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40763-5_3.

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

Handrich, Sebastian, and Ayoub Al-Hamadi. "Full-Body Human Pose Estimation by Combining Geodesic Distances and 3D-Point Cloud Registration." In Advanced Concepts for Intelligent Vision Systems. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25903-1_25.

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

Bloch, Isabelle. "Fuzzy morphology and fuzzy distances: New definitions and links in both euclidean and geodesic cases." In Fuzzy Logic in Artificial Intelligence. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/bfb0095076.

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

Hooijberg, Maarten. "Geodetic Arc Distances." In Practical Geodesy. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60584-0_4.

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

Conference papers on the topic "Geodesic distances"

1

Tekir, Selma, Florian Mansmann, and Daniel Keim. "Geodesic distances for web document clustering." In 2011 Ieee Symposium On Computational Intelligence And Data Mining - Part Of 17273 - 2011 Ssci. IEEE, 2011. http://dx.doi.org/10.1109/cidm.2011.5949449.

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

Li Yang. "Sammon's nonlinear mapping using geodesic distances." In Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpr.2004.1334180.

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

Yu Cai, Yanjin Huang, and Shugong Zhang. "3D face recognition using weighted geodesic distances." In 2011 International Conference on Transportation and Mechanical & Electrical Engineering (TMEE). IEEE, 2011. http://dx.doi.org/10.1109/tmee.2011.6199695.

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

Meng, Deyu, Zongben Xu, Nannan Gu, and Mingwei Dai. "Estimating geodesic distances on locally linear patches." In 2007 IEEE International Symposium on Signal Processing and Information Technology. IEEE, 2007. http://dx.doi.org/10.1109/isspit.2007.4458006.

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

Góes, Daniel A., and Nelson D. A. Mascarenhas. "Low-Dose Computed Tomography Filtering Using Geodesic Distances." In Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/sibgrapi.est.2020.12983.

Full text
Abstract:
Due to the concerns related to patient exposure to X-ray, the dosage used in computed tomography must be reduced (Low-dose Computed Tomography - LDCT). One of the effects of LDCT is the degradation in the quality of the final reconstructed image. In this work, we propose a method of filtering LDCT sinograms that are subject to signal-dependent Poisson noise. To filter this type of noise, we use a Bayesian approach, changing the Non-local Means (NLM) algorithm to use geodesic stochastic distances for Gamma distribution, the conjugate prior to Poisson, as a similarity metric between each projection point. Among the geodesic distances evaluated, we found a closed solution for the Shannon entropy for Gamma distributions. We compare our method with the following methods based on NLM: PoissonNLM, Stochastic Poisson NLM, Stochastic Gamma NLM and the original NLM after Anscombe transform. We also compare with BM3D after Anscombe transform. Comparisons are made on the final images reconstructed by the Filtered-Back Projection (FBP) and Projection onto Convex Sets (POCS) methods using the metrics PSNR and SSIM.
APA, Harvard, Vancouver, ISO, and other styles
6

Edelstein, Michal, Nestor Guillen, Justin Solomon, and Mirela Ben-Chen. "A Convex Optimization Framework for Regularized Geodesic Distances." In SIGGRAPH '23: Special Interest Group on Computer Graphics and Interactive Techniques Conference. ACM, 2023. http://dx.doi.org/10.1145/3588432.3591523.

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

Twining, C., S. Marsland, and C. Taylor. "Measuring Geodesic Distances on the Space of Bounded Diffeomorphisms." In British Machine Vision Conference 2002. British Machine Vision Association, 2002. http://dx.doi.org/10.5244/c.16.83.

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

Oda, Takuya, Yuichi Itoh, Wataru Nakai, Katsuhiro Nomura, Yoshifumi Kitamura, and Fumio Kishino. "Interactive skeleton extraction for 3D animation using geodesic distances." In ACM SIGGRAPH 2006 Research posters. ACM Press, 2006. http://dx.doi.org/10.1145/1179622.1179632.

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

Berretti, Stefano, Alberto Del Bimbo, Pietro Pala, and Francisco J. Silva Mata. "Geodesic Distances for 3D-3D and 2D-3D Face Recognition." In Multimedia and Expo, 2007 IEEE International Conference on. IEEE, 2007. http://dx.doi.org/10.1109/icme.2007.4284950.

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

Ring, Dan, and François Pitie. "Feature-Assisted Sparse to Dense Motion Estimation Using Geodesic Distances." In 2009 13th International Machine Vision and Image Processing Conference. IEEE, 2009. http://dx.doi.org/10.1109/imvip.2009.9.

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

Reports on the topic "Geodesic distances"

1

Memoli, Facundo, and Guillermo Sapiro. Distance Functions and Geodesics on Points Clouds. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada437158.

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

Jin, Zheming. A Study of Geodesic Distance Kernel on an Integrated GPU. Office of Scientific and Technical Information (OSTI), 2019. http://dx.doi.org/10.2172/1576565.

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

Dudnikov, V. Yu. Electronic course for distance learning "Basics of geodesy and topography" (UGSN 21.00.00 "Applied geology, mining, oil and gas and geodesy"). Science and Innovation Center Publishing House, 2016. http://dx.doi.org/10.12731/dudnikov.11082016.22085.

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!

To the bibliography