Jianer Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jianer Chen has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Jianxin Wang
School of Computer Science and Engineering, Central South University, Changsha, Hunan, China
10 shared publications - Iyad Kanj
School of Computing, Jarvis College of Computing and Digital Media, DePaul University, Chicago, IL, USA
7 shared publications - Ge Xia
College of Power Engineering, Naval University of Engineering, Wuhan 430033, China
6 shared publications - Songjian Lu
Texas A&M University
3 shared publications - Ergun Akleman
Texas A&M University, College Station, USA
2 shared publications - Fenghui Zhang
Texas A&M University
2 shared publications
Latest Publications
- 28 September 2024
- Published by Springer Nature
- p. 1-25
Complexity Issues on PTAS
- Open Access
A Modified de Casteljau Subdivision that Supports Smooth Stitching with Hierarchically Organized Bicubic Bezier Patches
One of the theoretically intriguing problems in computer-aided geometric modeling comes from the stitching of the tensor product Bezier patches. When they share an extraordinary vertex, it is not possible to obtain continuity C1 or G1 along the edges emanating from that extraordinary vertex. Unfortunately, this stitching problem cannot be solved by using higher degree or rational polynomials. In this paper, we present a modified de Casteljau subdivision algorithm that can provide a solution to this problem. Our modified de Casteljau subdivision, when combined with topological modeling, provides a framework for interactive real-time modeling of piecewise smooth manifold meshes with arbitrary topology. The main advantage of the modified subdivision is that the continuity C1 on a given boundary edge does not depend on the positions of the control points on other boundary edges. The modified subdivision allows us to obtain the desired C1 continuity along the edges emanating from the extraordinary vertices along with the desired G1 continuity in the extraordinary vertices.
Open AccessA Modified de Casteljau Subdivision that Supports Smooth Stitching with Hierarchically Organized Bicubic Bezier Patches
One of the theoretically intriguing problems in computer-aided geometric modeling comes from the stitching of the tensor product Bezier patches. When they share an extraordinary vertex, it is not possible to obtain continuity C1 or G1 along the edges emanating from that extraordinary vertex. Unfortunately, this stitching problem cannot be solved by using higher degree or rational polynomials. In this paper, we present a modified de Casteljau subdivision algorithm that can provide a solution to this problem. Our modified de Casteljau subdivision, when combined with topological modeling, provides a framework for interactive real-time modeling of piecewise smooth manifold meshes with arbitrary topology. The main advantage of the modified subdivision is that the continuity C1 on a given boundary edge does not depend on the positions of the control points on other boundary edges. The modified subdivision allows us to obtain the desired C1 continuity along the edges emanating from the extraordinary vertices along with the desired G1 continuity in the extraordinary vertices.
- Open Access
Projective Holder-Minkowski Colors: A Generalized Set of Commutative & Associative Operations with Inverse Elements for Representing and Manipulating Colors
One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework that can support a set of algebraic structures with associativity, commutativity, and inverse properties. To provide these three properties, we build our algebraic structures on an extension of projective space by allowing for negative and complex numbers. These properties are important for (1) manipulating colors as periodic functions, (2) solving inverse problems dealing with colors, and (3) being consistent with the wave representation of the color. Allowance of negative and complex numbers is not a problem for practical applications, since we can always convert the results into desired range for display purposes as we do in High Dynamic Range imaging. This set of algebraic structures can be considered as a generalization of the Minkowski norm Lp in projective space. These structures also provide a new version of the generalized Holder average with associativity property. Our structures provide inverses of any operation by allowing for negative and complex numbers. These structures provide all properties of the generalized Holder average by providing a continuous bridge between the classical weighted average, harmonic mean, maximum, and minimum operations using a single parameter p.
Open AccessProjective Holder-Minkowski Colors: A Generalized Set of Commutative & Associative Operations with Inverse Elements for Representing and Manipulating Colors
One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework that can support a set of algebraic structures with associativity, commutativity, and inverse properties. To provide these three properties, we build our algebraic structures on an extension of projective space by allowing for negative and complex numbers. These properties are important for (1) manipulating colors as periodic functions, (2) solving inverse problems dealing with colors, and (3) being consistent with the wave representation of the color. Allowance of negative and complex numbers is not a problem for practical applications, since we can always convert the results into desired range for display purposes as we do in High Dynamic Range imaging. This set of algebraic structures can be considered as a generalization of the Minkowski norm Lp in projective space. These structures also provide a new version of the generalized Holder average with associativity property. Our structures provide inverses of any operation by allowing for negative and complex numbers. These structures provide all properties of the generalized Holder average by providing a continuous bridge between the classical weighted average, harmonic mean, maximum, and minimum operations using a single parameter p.
- 1 September 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 786, 67-77
On scheduling inclined jobs on multiple two-stage flowshops
- 1 September 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 786, 67-77
On scheduling inclined jobs on multiple two-stage flowshops
- 10 April 2014
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 29 (1) , 257-275
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- 10 April 2014
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 29 (1) , 257-275
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- 7 December 2013
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 29 (1) , 125-140
Randomized parameterized algorithms for $P_2$ P 2 -Packing and Co-Path Packing problems- 7 December 2013
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 29 (1) , 125-140
Randomized parameterized algorithms for $P_2$ P 2 -Packing and Co-Path Packing problems- 26 July 2013
- Published by Springer Nature
- p. 723-746
Complexity Issues on PTAS
- 2 November 2012
- Published by Elsevier in Theoretical Computer Science
- Vol. 470, 105-119
Parameterized top-algorithms- 2 November 2012
- Published by Elsevier in Theoretical Computer Science
- Vol. 470, 105-119
Parameterized top-algorithms- Open Access
- 25 June 2012
- Published by Springer Nature in BMC Bioinformatics
- Vol. 13 (S10) , S1
Guest Editors' Introduction
- 25 June 2012
- Published by Springer Nature in BMC Bioinformatics
- Vol. 13 (S10) , S1
Open AccessGuest Editors' Introduction
- 24 February 2012
- Published by Springer Nature
- p. 1-7
Maximum Partition Matching