Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Wenping Lou

dblp:48/521 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape modeling › parametric modeling
bézier curves
0.012000
Degree reduction of interval Bézier curves · Comput. Aided Des. 2000
Geometric modeling and processing › shape representation
curve representation
0.012000
Degree reduction of interval Bézier curves · Comput. Aided Des. 2000
Geometric modeling and processing › computer-aided design › computer-aided geometric design
degree reduction
0.012000
Degree reduction of interval Bézier curves · Comput. Aided Des. 2000
Mathematical optimization › numerical analysis
interval arithmetic
0.012000
Degree reduction of interval Bézier curves · Comput. Aided Des. 2000

Methods — techniques the papers use, named apart from their topics

interval bézier curves · 0.1
YearPublicationVenuePosition
2000 Bounding Interval Rational Bézier Curves with Interval Polynomial Bézier Curves
abstract
In this paper we put forward and study the problem of bounding an interval rational Bezier curve with an interval polynomial Bezier curve. We propose three different methods-hybrid method, perturbation method and linear programming method to solve this problem. Examples are illustrated to compare the three different methods. The empirical results show that the perturbation method and the linear programming method produce much tighter bounds than the hybrid method, though they are computationally several times more expensive.
Falai Chen, Thomas W. Sederberg, Wenping Lou
GMP3
2000 Degree reduction of interval Bézier curves
Falai Chen, Wenping Lou
Comput. Aided Des.2