Related papers: The complexity of the normal surface solution spac…
As science and engineering have become increasingly data-driven, the role of optimization has expanded to touch almost every stage of the data analysis pipeline, from signal and data acquisition to modeling and prediction. The optimization…
Applying Morse theory, we give a standard form for a class of surfaces which includes all the properly embedded incompressible surfaces in 3-dimensional handlebodies. We also give a necessary and sufficient condition to determine the…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
This} paper presents relations between least area and normal surfaces, embedded in either a Euclidean or hyperbolic $3$-manifold. A relaxed version of normal surfaces, termed quasi-normal, is introduced, and it is shown that under…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings,…
We interpret a normal surface in a (singular) three-manifold in terms of the homology of a chain complex. This allows us to study the relation between normal surfaces and their quadrilateral co-ordinates. Specifically, we give a proof of an…
The aim of this paper is to discuss some applications of general topology in computer algorithms including modeling and simulation, and also in computer graphics and image processing. While the progress in these areas heavily depends on…
A major breakthrough in the theory of topological algorithms occurred in 1992 when Hyam Rubinstein introduced the idea of an almost normal surface. We explain how almost normal surfaces emerged naturally from the study of geodesics and…
Since publication of the main contributions on the theory of kinetic roughening more than fifteen years ago, many works have been reported on surface growth or erosion that employ the framework of dynamic scaling. This interest was mainly…
Surface normal integration is a fundamental problem in computer vision, dealing with the objective of reconstructing a surface from its corresponding normal map. Existing approaches require an iterative global optimization to jointly…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
It is well known since Noether that the gonality of a smooth plane curve of degree d>3 is d-1. Given a k-dimensional complex projective variety X, the most natural extension of gonality is probably the degree of irrationality, that is the…
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…