default search action

combined dblp search
author search
venue search
publication search

ask others

Marloes L. P. van Lierop

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

1980 – 1989

see FAQ

What is the meaning of the colors in the publication lists?

1988
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/cvgip/LieropOW88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cvgip/LieropOW88
Marloes L. P. van Lierop, Cornelius W. A. M. van Overveld, Huub M. M. van de Wetering:
Line rasterization algorithms that satisfy the subset line property. Comput. Vis. Graph. Image Process. 41(2): 210-228 (1988)
1986
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/cvgip/Lierop86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cvgip/Lierop86
Marloes L. P. van Lierop:
Geometrical transformations on pictures represented by leafcodes. Comput. Vis. Graph. Image Process. 33(1): 81-98 (1986)
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/eurographics/OverveldL86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurographics/OverveldL86
Cornelius W. A. M. van Overveld, Marloes L. P. van Lierop:
A consistent algorithm to fill triangles and triangular patches. Eurographics 1986
1985
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/integration/Lierop85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/integration/Lierop85
Marloes L. P. van Lierop:
A flexible bottom-up approach for layout generation. Integr. 3(1): 49-59 (1985)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.