Suchergebnisse - "[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]"

A Software to Visualize, Edit, Model and Mesh Vascular Networks von Decroocq, Meghane, Lavoue, Guillaume, Ohta, Makoto, Frindel, Carole

“… Computational fluid dynamics (CFD) is a key tool for a wide range of research areas, beyond the computer science community. In particular, CFD is used in …”
Volltext

Segmentation of unbalanced and in-homogeneous point clouds and its application to 3D scanned trees von Morel, Jules, Bac, Alexandra, Kanai, Takashi

“… Segmentation of 3D point clouds is still an open issue in the case of unbalanced and in-homogeneous data-sets. In the application context of the modeling of …”
Volltext

Packing Arc-Disjoint Cycles in Tournaments von Bessy, Stéphane, Bougeret, Marin, Krithika, R., Sahu, Abhishek, Saurabh, Saket, Thiebaut, Jocelyn, Zehavi, Meirav

Volltext

Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front von Dupin, Nicolas, Nielsen, Frank, Talbi, El-Ghazali

“… With many efficient solutions for a multi-objective optimization problem, this paper aims to cluster the Pareto Front in a given number of clusters K and to …”
Volltext

Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees von Castelli Aleardi, Luca, Devillers, Olivier

“… We consider the problem of designing space efficient solutions for representing triangle meshes. Our main result is a new explicit data structure for compactly …”
Volltext

Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d von Bremner, David, Devillers, Olivier, Glisse, Marc, Lazard, Sylvain, Liotta, Giuseppe, Mchedlidze, Tamara, Moroz, Guillaume, Whitesides, Sue, Wismath, Stephen

“… We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each …”
Volltext

Upper and Lower Bounds for Online Routing on Delaunay Triangulations von Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perković, André van Renssen

Volltext

Matching correspondence between images and 3D model in a reconstruction process von Tien, Mau Le, Tan, Khoi Nguyen, Raffin,, Romain

Volltext

Matching correspondence between images and 3D model in a reconstruction process von Tien, Mau Le, Tan, Khoi Nguyen, Raffin, Romain

“… 3D reconstruction from photographies is an active research trend. The resolution of the sensors is increasing and the data processing is more accurate (not …”
Volltext

On the Number of 2-Protected Nodes in Tries and Suffix Trees von Gaither, Jeffrey, Homma, Yushi, Sellke, Mark, Ward, Mark Daniel

“… We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers …”
Volltext

Joint String Complexity for Markov Sources von Jacquet, Philippe, Szpankowski, Wojciech

“… String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define $\textit{joint string …”
Volltext

On the number of transversals in random trees von Gittenberger, Bernhard, Kraus, Veronika

“… We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our investigation treats the average number of transversals of …”
Volltext

Stokes polyhedra for $X$-shaped polyminos von Baryshnikov, Yu, Hickok, L., Orlow, N., Son, S.

“… Consider a pair of $\textit{interlacing regular convex polygons}$, each with $2(n + 2)$ vertices, which we will be referring to as $\textit{red}$ and …”
Volltext

On Greedy Trie Execution von Gołębiewski, Zbigniew, Zagórski, Filip

“… In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where …”
Volltext

Domination analysis for scheduling on non preemptive uniformly related machines von Eisner, Idan, Vainshtein, Alek

Volltext

Exact $L^2$-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract) von Bindjeme, Patrick, fill, james Allen

“… Using a recursive approach, we obtain a simple exact expression for the $L^2$-distance from the limit in the classical limit theorem of Régnier (1989) for the …”
Volltext

Data Streams as Random Permutations: the Distinct Element Problem von Helmi, Ahmed, Lumbroso, Jérémie, Martínez, Conrado, Viola, Alfredo

“… In this paper, we show that data streams can sometimes usefully be studied as random permutations. This simple observation allows a wealth of classical and …”
Volltext

Some exact asymptotics in the counting of walks in the quarter plane von Fayolle, Guy, Raschel, Kilian

“… Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, …”
Volltext

On total variation approximations for random assemblies von Manstavičius, Eugenijus

“… We prove a total variation approximation for the distribution of component vector of a weakly logarithmic random assembly. The proof demonstrates an analytic …”
Volltext

Approximate Counting via the Poisson-Laplace-Mellin Method von Fuchs, Michael, Lee, Chung-Kuei, Prodinger, Helmut

“… Approximate counting is an algorithm that provides a count of a huge number of objects within an error tolerance. The first detailed analysis of this algorithm …”
Volltext