MACIS 2015 Session (SS1): Algorithms for Curves and Surfaces
MACIS 2015:
Home,
Sessions Page
Organizers
- Vikram Sharma
(The Institute of Mathematical Sciences, Chennai, India)
Aim and Scope
Curves and Surfaces play a fundamental role in many fields, such as
Computational Geometry, Computer Aided Design, Computer Graphics,
Geometric Modeling to name a few.
Consequently, algorithms
that handle various aspects of these geometric objects are very important. The aim of this
session is to facilitate communication between researchers who are
addressing fundamental algorithmic issues in the
treatment of curves and surfaces.
We welcome papers that
explore the interplay between geometry, algebra and numerical computation
when designing algorithms for curves and surfaces, or
provide complexity analysis on the running time of such algorithms.
Topics (including, but not limited to)
- Algorithms for computing the topology of algebraic curves and surfaces
- Algorithms for visualizing algebraic curves and surfaces
- Applications of curves and surfaces in scientific computing
- Complexity analysis of algorithms for curves and surfaces
- Meshing and refinement of surfaces
Publications
- A short abstract will appear on the conference web page
as soon as your
paper is accepted,
and a post-conference proceedings will be published by
Springer LNCS.
- Several special issues of the journal
Mathematics in Computer Science,
published by
Birkhauser/Springer, will be organized after the
conference by session organizers. REGULAR (not SHORT)
papers would be considered for these special issues.
Submission Guidelines
- If you would like to give a talk at MACIS, you need to submit
at least a SHORT paper -- see
guideline
for the details. This session is designated as SS1.
- After the meeting,
the submission guideline for a journal special issue
will be communicated to you by the session organizers.
- The deadline for all submissions is *September 1, 2015* -- see the
Call for
Papers for the details. The deadline for notification on regular
papers is *October 1, 2015*.
Talks/Abstracts
-
Linear k-Monotonicity Preserving Algorithms and Their Approximation Properties
S.P. Sidorov (Department of Mathematics and Mechanics, Saratov State University, Russian Federation)
Abstract: The paper shows that if a linear operator (algorithm) with finite rank n preserves k-monotonicity, the degree of simultaneous ap-
proximation of derivative of order 0 <= i <= k of continuous functions by derivatives of this operator cannot be better than n^{-2}
even on the set of algebraic polynomials of degree k+2 (as well as on bounded subsets of Sobolev space W_\infty^(k+2)[0,1]).