Add to ORKGInternational audienceIn these note we review some basic approaches and algorithms for discrete plane/hyperplane recognition. We present, analyze, and compare related theoretical and experimental results and discuss on the possibilities for creating algorithms with higher efficiency
This book provides comprehensive coverage of the modern methods for geometric problems in the comput...
International audiencePlane-probing algorithms have become fundamental tools to locally capture arit...
International audienceWe show that the plane-probing algorithms introduced in Lachaud et al. (J. Mat...
International audienceIn these note we review some basic approaches and algorithms for discrete plan...
International audienceA naive digital plane is a subset of points $(x,y,z) \in \mathbb{Z} ^3$ verify...
Rapport interne.A naive digital plane with integer coefficients is a subset of points (x,y,z) in Z^3...
AbstractA new digital hyperplane recognition method is presented. This algorithm allows the recognit...
International audienceLine and plane recognition is one of the essential tasks in the field of compu...
International audienceWe present a new plane-probing algorithm, i.e., an algorithm that computes the...
International audienceWe introduce a new discrete primitive, the blurred piece of a discrete plane, ...
International audienceThis paper is composed of two parts. In the first one, we present an analysis ...
International audienceDiscrete Geometry constitutes one of the great families of methods dedicated t...
International audienceA new digital hyperplane recognition method is presented. This algorithm allow...
Digital geometry emerged as an independent discipline in the second half of the last century. It dea...
AbstractA naive digital plane is a subset of points (x,y,z)∈Z3 verifying h⩽ax+by+cz<h+max{|a|,|b|,|c...
This book provides comprehensive coverage of the modern methods for geometric problems in the comput...
International audiencePlane-probing algorithms have become fundamental tools to locally capture arit...
International audienceWe show that the plane-probing algorithms introduced in Lachaud et al. (J. Mat...
International audienceIn these note we review some basic approaches and algorithms for discrete plan...
International audienceA naive digital plane is a subset of points $(x,y,z) \in \mathbb{Z} ^3$ verify...
Rapport interne.A naive digital plane with integer coefficients is a subset of points (x,y,z) in Z^3...
AbstractA new digital hyperplane recognition method is presented. This algorithm allows the recognit...
International audienceLine and plane recognition is one of the essential tasks in the field of compu...
International audienceWe present a new plane-probing algorithm, i.e., an algorithm that computes the...
International audienceWe introduce a new discrete primitive, the blurred piece of a discrete plane, ...
International audienceThis paper is composed of two parts. In the first one, we present an analysis ...
International audienceDiscrete Geometry constitutes one of the great families of methods dedicated t...
International audienceA new digital hyperplane recognition method is presented. This algorithm allow...
Digital geometry emerged as an independent discipline in the second half of the last century. It dea...
AbstractA naive digital plane is a subset of points (x,y,z)∈Z3 verifying h⩽ax+by+cz<h+max{|a|,|b|,|c...
This book provides comprehensive coverage of the modern methods for geometric problems in the comput...
International audiencePlane-probing algorithms have become fundamental tools to locally capture arit...
International audienceWe show that the plane-probing algorithms introduced in Lachaud et al. (J. Mat...