Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries

In this paper we prove that the problem of deciding contractibility of an arbitrary closed curve on the boundary of a 3-manifold is in NP. We emphasize that the manifold and the curve are both inputs to the problem. Moreover, our algorithm also works if the curve is given as a compressed word. Previously, such an algorithm was known for simple (non-compressed) curves, and, in very limited cases, for curves with self-intersections. Furthermore, our algorithm is fixed-parameter tractable in the complexity of the input 3-manifold. As part of our proof, we obtain new polynomial-time algorithms for compressed curves on surfaces, which we believe are of independent interest. We provide a polynomial-time algorithm which, given an orientable surface and a compressed loop on the surface, computes a canonical form for the loop as a compressed word. In particular, contractibility of compressed curves on surfaces can be decided in polynomial time; prior published work considered only constant genus surfaces. More generally, we solve the following normal subgroup membership problem in polynomial time: given an arbitrary orientable surface, a compressed closed curve ?, and a collection of disjoint normal curves ?, there is a polynomial-time algorithm to decide if ? lies in the normal subgroup generated by components of ? in the fundamental group of the surface after attaching the curves to a basepoint

The normal parameterization and its application to collision detection

Collision detection is a central task in the simulation of multibody systems. Depending on the description of the geometry, there are many efficient algorithms to address this need. A widespread approach is the common normal concept: potential contact points on opposing surfaces have antiparallel normal vectors. However, this approach leads to implicit equations that require iterative solutions when the geometries are described by implicit functions or the common parameterizations. We introduce the normal parameterization to describe the boundary of a strictly convex object as a function of the orientation of its normal vector. This parameterization depends on a scalar function, the so-called generating potential from which all properties are derived: points on the boundary, continuity/differentiability of the boundary, curvature, offset curves or surfaces. An explicit solution for collisions with a planar counterpart is derived and four iterative algorithms for collision detection between two arbitrary objects with the normal parametrization are compared. The application of this approach for collision detection in multibody models is illustrated in a case study with two ellipsoids and several planes

Algorithms for recognizing knots and 3-manifolds

This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.Comment: 17 Pages, 7 figures, to appear in Chaos, Fractals and Soliton

Using semi-implicit representation of algebraic surfaces

In a previous work we introduced a new general representation of algebraic surfaces, that we called semi-implicit, which encapsulates both usual and less known surfaces. Here we specialize this notion in order to apply it in Solid Modeling: we view a surface in the real space as a one-parameter (algebraic) family of algebraic low-degree curves. The paper mainly addresses the topic of performing the usual CAD operations with semi-implicit representation of surfaces. We derive formulae for computing the normal and the curvatures at a regular point. We provide exact algorithms for computing self-intersections of a surface and more generally its singular locus. We also present some surface/surface intersection algorithms relying on generalized resultant calculations

A CM construction for curves of genus 2 with p-rank 1

We construct Weil numbers corresponding to genus-2 curves with $p$-rank 1 over the finite field \F_{p^2} of $p^2$ elements. The corresponding curves can be constructed using explicit CM constructions. In one of our algorithms, the group of \F_{p^2}-valued points of the Jacobian has prime order, while another allows for a prescribed embedding degree with respect to a subgroup of prescribed order. The curves are defined over \F_{p^2} out of necessity: we show that curves of $p$-rank 1 over \F_p for large $p$ cannot be efficiently constructed using explicit CM constructions.Comment: 19 page