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 P. Burton

dblp:b/RobertPBurton · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Theory of computation · 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.

Computer graphics and multimedia
1 paper
Rendering · 50% Geometric modeling and processing · 50%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › computational geometry › polyhedral geometry
convex hull
0.011982
A Hidden-Line Algorithm for Hyperspace · SIAM J. Comput. 1982
Rendering › hidden surface removal
hidden-line removal
0.011982
A Hidden-Line Algorithm for Hyperspace · SIAM J. Comput. 1982

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

object-space algorithm · 0.0minimax test · 0.0
YearPublicationVenuePosition
2018 Fourveo: Integration of 4D animation into conventional 3D animation workflows
abstract
Abstract We have developed a software package that facilitates general‐purpose animation in four spatial dimensions. Standard features from popular 3D animation software have been included and adapted, where appropriate. Many adaptations are trivial; some have required novel solutions. Several features that are possible only in four or more dimensions have been included. The graphical user interface has been designed to be familiar to experienced 3D animators. Keyframe animation is provided by using a set of curves that defines movement in each dimension or rotation plane. An interactive viewport offers multiple visualization methods including slicing and projection. The viewport allows for both manipulation of 4D objects and navigation through virtual 4D space.
Justin A. Jensen, Robert P. Burton
Comput. Animat. Virtual Worlds2
2009 Versatile reactive navigation
abstract
Most autonomous mobile agents operate in a highly constrained environment. Despite significant research, existing solutions are limited in their ability to handle heterogeneous constraints within highly dynamic or uncertain environments. This paper presents a novel maneuver selection technique suited for both 2D and 3D environments with highly dynamic maneuvering constraints and multiple mobile obstacles. Agents may have any arbitrary set of nonholonomic control variables; maneuvers can be constrained by a broad class of function inequalities, including time-dependent constraints involving nonlinear relationships between controlled and agent-state variables. The resulting algorithm has been implemented to run in real time using only a fraction of the CPU's capacity on an ordinary notebook computer and performs well in a number of taxing simulated situations.
Luther A. Tychonievich, Robert P. Burton, Louis P. Tychonievich
IROS2
1997 Piles for hyperdimensional graphics
John D. Melville, Robert P. Burton
Comput. Graph.2
1996 Generation and graphical analysis of Mandelbrot and Julia sets in more than four dimensions
Stephen L. Dixon, Kevin L. Steele, Robert P. Burton
Comput. Graph.3
1990 Computer graphics software construction: J. R. Rankin Prentice-Hall, Sydney, Australia (1988) 544pp
Robert P. Burton
Comput. Aided Des.1
1988 Varieties of computer graphics courses in computer science
abstract
The increased importance of graphics in computer systems has made computer graphics a more visible and important part of computer science education. This graphics education can take any of several forms. This panel describes four of these: the graphics service course for non-majors, the graphics systems course, the graphics concepts and algorithms course, and advanced or graduate courses in graphics. This panel is based on part of a workshop presented at SIGGRAPH '87.
Steve Cunningham, Judith R. Brown, Robert P. Burton, Mark R. Ohlson
SIGCSE3
1987 File processing and the undergraduate computer science curriculum
abstract
In March of 1979, the Curriculum Committee on Computer Science (C3 S) of the Association for Computing Machinery (ACM) proposed recommendations for the undergraduate curriculum in computer science: “Curriculum '78.” “Curriculum '78” includes CS 5, “Introduction to File Processing,” as an undergraduate core requirement. Seven years after “Curriculum '78,” findings show that more than 70% of universities offering undergraduate degrees in computer science do not require a course similar to CS 5. The controversial role of CS 5 in the undergraduate computer science curriculum id discussed.
Kirk L. Malmrose, Robert P. Burton
SIGCSE2
1982 A Hidden-Line Algorithm for Hyperspace
abstract
An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the selected viewing hyperspace. When shape alone is the attribute of interest, hidden-line elimination need be performed only in that hyperspace. The algorithm is of value in the production of shadows of hyperdimensional models, including but not limited to four-dimensional space-time models, the hyperdimensional elementary catastrophe models and multivariate statistical models.
Robert P. Burton, David R. Smith
SIAM J. Comput.1