• Suche: "F.2.2.2: Geometrical problems and computations"

Treffer 21 - 40 von 45

21

Building Efficient and Compact Data Structures for Simplicial Complexe
Boissonnat, Jean-Daniel ; Srikanta, Karthik C. ; Tavenas, Sébastien ; et al.
Algorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩

NP-hard Automaton Compact data structures Simplicial complex ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Zeitschrift
Zu den Favoriten
22

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
Courtieu, Pierre ; Rieg, Lionel ; Tixeuil, Sébastien ; et al.
[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015

ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.1: Models of Computa... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... …
Report
Zu den Favoriten
23

A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.

Delaunay complex witness complex relaxed Delaunay complex distance and incircle pr... simplex quality Lovàsz local lemma …
E-Ressource
Zu den Favoriten
24

Only distances are required to reconstruct submanifolds
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
[Research Report] INRIA Sophia Antipolis. 2014

Witness complex power protection sampling manifold reconstruction ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
25

Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper)
Bramas, Quentin ; Tixeuil, Sébastien ; Networks and Performance Analysis (NPA) ; et al.
International Symposium on Stabilization. :88-93

Lyon, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... F.2.2.2: Geometrical pro... …
Konferenz
Zu den Favoriten
26

Decomposition of multihomogeneous polynomials: minimal number of variables
Berthomieu, Jérémy ; Polynomial Systems (PolSys) ; Laboratoire d'Informatique de Paris 6 (LIP6) ; et al.

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-SC]Computer S... Symbolic Computation [cs... …
E-Ressource
Zu den Favoriten
27

A probabilistic algorithm to compute the real dimension of a semi-algebraic set
Safey El Din, Mohab ; Tsigaridas, Elias ; Polynomial Systems (PolSys) ; et al.

symbolic computation complexity Effective real algebraic... real dimension ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... …
E-Ressource
Zu den Favoriten
28

Triangulating Smooth Submanifolds with Light Scaffolding
Boissonnat, Jean-Daniel ; Ghosh, Arijit ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-7660, INRIA. 2011

computational topology computational geometry manifold sampling Manifold triangulation meshing manifold learning …
Report
Zu den Favoriten
29

Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds
Caroli, Manuel ; Teillaud, Monique ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-7352, INRIA. 2010

Delaunay triangulation Euclidean manifold crystallographic groups simplicial complex flat manifold closed manifold …
Report
Zu den Favoriten
30

Topological Inference via Meshing
Hudson, Benoît ; Miller, Gary, L. ; Oudot, Steve, Y. ; et al.
[Research Report] RR-7125, INRIA. 2009

Topological persistence Delaunay triangulation offsets sparse Voronoi refinemen... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
31

Robust and Efficient Delaunay triangulations of points on or close to a sphere
Caroli, Manuel ; Machado Manhães de Castro, Pedro ; Loriot, Sebastien ; et al.
[Research Report] RR-7004, INRIA. 2009

Computational Geometry Delaunay Triangulation Voronoi Diagram Sphere Space of Circles Exact Geometric Computin... …
Report
Zu den Favoriten
32

Computing 3D Periodic Triangulations
Caroli, Manuel ; Teillaud, Monique ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-6823, INRIA. 2009

flat torus periodic Delaunay triangulation simplicial complex ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
33

Persistence-Based Clustering in Riemannian Manifolds
Chazal, Frédéric ; Guibas, Leonidas J. ; Oudot, Steve, Y. ; et al.
[Research Report] RR-6968, INRIA. 2009, 47 p

clustering unsupervised learning topological persistence Rips graph barcode computational topology …
Report
Zu den Favoriten
34

Modeling, Analysis, Digital image representation Combinatorial approach of imagery
Modélisation, Analyse, Représentation des Images Numériques Approche combinatoire de l’imagerie
Fiorio, Christophe ; Image & Interaction (ICAR) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Traitement des images [eess.IV]. Université Montpellier 2, 2008

combinatorial algorithms Digital image image processing digital topology region segmentation Combinatorial maps …
Report
Zu den Favoriten
35

Analysis of Scalar Fields over Point Cloud Data
Chazal, Frédéric ; Guibas, Leonidas J. ; Oudot, Steve Y. ; et al.
[Research Report] RR-6576, INRIA. 2008

Persistent homology Persistence modules Sampling theory Vietoris-Rips complexes Morse theory ACM: F.: Theory of Compu... …
Report
Zu den Favoriten
36

Delaunay Triangulation of Manifolds
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
Foundations of Computational Mathematics. 45:38-38

manifold triangulation Delaunay complex protection perturbation ACM: F.: Theory of Compu... …
Zeitschrift
Zu den Favoriten
37

Computing the Distance between Piecewise-Linear Bivariate Functions
Moroz, Guillaume ; Aronov, Boris ; Effective Geometric Algorithms for Surfaces and Visibility (VEGAS) ; et al.
ACM Transactions on Algorithms. 12(1):3-3

polyhedral terrain multipoint evaluation piecewise-linearfunction ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Zeitschrift
Zu den Favoriten
38

Stateless Reliable Geocasting
Adamek, Jordan ; Nesterenko, Mikhail ; Robinson, James Scott ; et al.
36th IEEE Symposium on Reliable Distributed Systems (SRDS 2017), Sep 2017, Hong Kong, China

Hong Kong, China ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.2: Network Protocols C.2.4: Distributed Syste... ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
39

Anisotropic Delaunay Mesh Generation
Boissonnat, Jean-Daniel ; Wormser, Camille ; Yvinec, Mariette ; et al.
[Research Report] RR-7712. :50-50

Delaunay triangulation anisotropic meshes mesh generation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Report
Zu den Favoriten
40

On the Complexity of the Generalized MinRank Problem
Faugère, Jean-Charles ; Safey El Din, Mohab ; Spaenlehauer, Pierre-Jean ; et al.
Journal of Symbolic Computation. 55:30-58

ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... I.1.2: Algorithms I.1.2.0: Algebraic algor... I.1.2.1: Analysis of alg... ACM: F.: Theory of Compu... …
Zeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter