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.
? Tutorial for this page

Robert Duisberg

dblp:05/2372 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none

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

Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 50% Programming languages and type systems · 50%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › logic programming
constraint hierarchy
0.011987
Constraint Hierarchies · OOPSLA 1987
Requirements engineering and software design
constraint satisfaction
0.011987
Constraint Hierarchies · OOPSLA 1987
Automated reasoning and model checking
constraint solving
0.011987
Constraint Hierarchies · OOPSLA 1987
User interface design and tools
constraint-based user interface
0.011986
Constraint-Based Tools for Building User Interfaces · ACM Trans. Graph. 1986

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

constraint hierarchy solver · 0.0object-oriented constraint representation · 0.0constraint satisfaction · 0.0
YearPublicationVenuePosition
1987 Constraint Hierarchies
abstract
Constraints describe relations that must be maintained, and provide a useful tool for such applications as interactive simulations, algorithm animation, and graphical user interface construction. We describe a major overhaul and extension to the constraint satisfaction mechanism in ThingLab, a constraint-oriented simulation laboratory written in the Smalltalk-80 language. First, a specification is presented of constraint hierarchies. Such hierarchies include both required constraints and default constraints of differing strengths, thus adding considerable expressive power to the system. Second, an algorithm for satisfying constraint hierarchies is described. The new satisfier is substantially faster than the previous version, even though it also includes new functionality.
Alan Borning, Robert Duisberg, Bjørn N. Freeman-Benson, Axel Kramer, Michael Woolf
OOPSLA2
1987 Animation Using Temporal Constraints: An Overview of the Animus System
abstract
Algorithm animation has a growing role in computer-aided algorithm design, documentation, and debugging, because interactive graphics is a richer channel than text for communication. Most animation is currently done laboriously by hand, and it often has the character of canned demonstrations with restricted user interaction. Animus is a system that allows for easy construction of an animation with minimal concern for lower-level graphics programming. Constraints are used to describe the appearance and structure of a picture as well as how those pictures evolve in time. The implementation and support of temporal constraints are substantive extensions to previous constraint languages that had only allowed for the specification of a static state. Use of the Animus system is demonstrated in the creation of animations of dynamic mechanical and electrical circuit simulations, sorting algorithms, problems in operating systems, and geometric curve drawing algorithms.
Robert Duisberg
Hum. Comput. Interact.1
1986 Constraint-Based Tools for Building User Interfaces
abstract
A constraint describes a relation that must be maintained. Constraints provide a useful mechanism to aid in the construction of interactive graphical user interfaces. They can be used to maintain consistency between data and a view of the data, to maintain consistency among multiple views, to specify layout, and to specify relations between events and responses for describing animations of interactive systems and event-driven simulations. Object-oriented techniques for constraint representation and satisfaction are presented, and a range of examples that demonstrate the practical use of static and temporal constraints for such purposes is presented. These examples include animations of algorithms and physics simulations, and constructing user-interface elements such as file browsers, views onto statistical data, and an interactive monitor or a simulated operating system.
Alan Borning, Robert Duisberg
ACM Trans. Graph.2