Related papers: Space Subdivision to Speed-up Convex Hull Construc…
We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…
As a fundamental part of computational healthcare, Computer Tomography (CT) and Magnetic Resonance Imaging (MRI) provide volumetric data, making the development of algorithms for 3D image analysis a necessity. Despite being computationally…
This paper tackles the problem of data abstraction in the context of 3D point sets. Our method classifies points into different geometric primitives, such as planes and cones, leading to a compact representation of the data. Being based on…
A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck algorithm is presented. The new algorithm in E2 is based on dual space representation and…
Given a subset $\mathbf{S}=\{A_1, \dots, A_m\}$ of $\mathbb{S}^n$, the set of $n \times n$ real symmetric matrices, we define its {\it spectrahull} as the set $SH(\mathbf{S}) = \{p(X) \equiv (Tr(A_1 X), \dots, Tr(A_m X))^T : X \in…
We discuss in some details a novel algorithm for performing partial-sky spherical harmonic transforms (SHT), building on the Fourier-sphere method of Reinecke et al (2023) handling efficiently high numbers of arbitrary locations on the…
Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…
Accurately drawing 3D objects is difficult for untrained individuals, as it requires an understanding of perspective and its effects on geometry and proportions. Step-by-step tutorials break the complex task of sketching an entire object…
Satellite observation scheduling plays a significant role in improving the efficiency of Earth observation systems. To solve the large-scale multi-satellite observation scheduling problem, this paper proposes an ensemble of meta-heuristic…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…
Clustering is a fundamental task in data analysis, and spectral clustering has been recognized as a promising approach to it. Given a graph describing the relationship between data, spectral clustering explores the underlying cluster…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…
The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…
Subgradient algorithms for training support vector machines have been quite successful for solving large-scale and online learning problems. However, they have been restricted to linear kernels and strongly convex formulations. This paper…
We consider convex-concave saddle-point problems where the objective functions may be split in many components, and extend recent stochastic variance reduction methods (such as SVRG or SAGA) to provide the first large-scale linearly…
CAT(0) metric spaces and hyperbolic spaces play an important role in combinatorial and geometric group theory. In this paper, we present efficient algorithms for distance problems in CAT(0) planar complexes. First of all, we present an…
Based on previous results of digital topology, this paper focuses on algorithms of topological invariants of objects in 2D and 3D Digital Spaces. We specifically interest in solving hole counting of 2D objects and genus of closed surface in…
Hatching is a common method used by artists to accentuate the third dimension of a sketch, and to illuminate the scene. Our system SHAD3S attempts to compete with a human at hatching generic three-dimensional (3D) shapes, and also tries to…
Subdivision surfaces provide an elegant isogeometric analysis framework for geometric design and analysis of partial differential equations defined on surfaces. They are already a standard in high-end computer animation and graphics and are…