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

David Knott

dblp:57/4485 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Databases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 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 · 70% Computer animation and physical simulation · 30%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
design rationale
0.112009
Capturing design rationale · Comput. Aided Des. 2009
Geometric modeling and processing
collision detection
0.112005
Interactive collision detection between deformable models using chromatic decomposition · ACM Trans. Graph. 2005
Geometric modeling and processing › collision detection
deformable model collision detection
0.112005
Interactive collision detection between deformable models using chromatic decomposition · ACM Trans. Graph. 2005
Geometric modeling and processing
mesh processing
0.112005
Interactive collision detection between deformable models using chromatic decomposition · ACM Trans. Graph. 2005
Computer animation and physical simulation › collision handling
self-collision
0.112005
Interactive collision detection between deformable models using chromatic decomposition · ACM Trans. Graph. 2005
Medical and health informatics
medical simulation
0.012005
Interactive collision detection between deformable models using chromatic decomposition · ACM Trans. Graph. 2005
Computer animation and physical simulation
cloth simulation
0.012005
Interactive collision detection between deformable models using chromatic decomposition · ACM Trans. Graph. 2005

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

linear-time culling · 0.1chromatic decomposition · 0.1
YearPublicationVenuePosition
2014 An Efficient Co-processing Framework for Large-Scale Scientific Applications
abstract
As scientific applications like Computational Fluid Dynamics (CFD) simulations generate more and more data, co-processing becomes the most cost effective way to process the vast amount of data generated by these simulation. In a co-processing environment, analysis and/or visualization of intermediate results occur concurrently to the simulation itself. Improved efficiency and early insight into the simulation process and results are potential advantages in comparison to postprocessing, where analysis and/or visualization are performed after the completion of the simulation. To enable co-processing, however, intermediate data needs to be shared between simulation and data analysis, and some degree of coordination may be required to maintain the correctness of both simulation and data analysis. The overhead incurred to facilitate data sharing and coordination may well offset benefits gained, particularly where distributed, large-scale systems are involved as workload sharing, processor affinity and data locality introduce significant effects to the overall performance. In this paper, we propose a co-processing framework to address these issues. The empirical benchmarking results suggest that co-processing overhead tasks scale well with the system size, the overall gain of about 20% in turnaround time compared to post-processing and that the coprocessing framework allows simulation and data analysis task to scale up to their individual limits.
Rubing Duan, Rick Siow Mong Goh, Lily Rachmawati, Long Wang 0005, Henry Novianus Palit, Xiaorong Li, Chi Keong Goh, Partha Sarathi Dutta, Leigh Lapworth, David Knott
CloudCom10
2009 Capturing design rationale
Rob H. Bracewell, Ken M. Wallace, Michael Moss, David Knott
Comput. Aided Des.4
2005 Acquisition and maintenance of constraints in engineering design
abstract
The Designers' Workbench is a system, developed by the Advanced Knowledge Technologies (AKT) consortium to support designers in large organizations, such as Rolls- Royce, by making sure that a design is consistent with the specification for the particular design as well as with the company's design rule book(s). Currently, to capture the constraint information, a domain expert (design engineer) has to work with a knowledge engineer to identify the constraints, and it is then the task of the knowledge engineer to encode these into the Workbench's knowledge base (KB). This is an error prone and time consuming task. It is highly desirable to relieve the knowledge engineer of this task, and so we have developed a tool, ConEditor, that enables domain experts themselves to capture and maintain these constraints. The tool allows the user to combine selected entities from the domain ontology with keywords and operators of a constraint language to form a constraint expression. We hypothesize that to apply constraints appropriately, it is necessary to understand the context in which each constraint is applicable. We refer to this as "application conditions". We plan to make these application conditions machine interpretable and investigate how they, together with a domain ontology, can be used to support the verification and maintenance of constraints.
Suraj Ajit, Derek H. Sleeman, David W. Fowler, David Knott, Kit-Ying Hui
K-CAP4
2005 Interactive collision detection between deformable models using chromatic decomposition
abstract
We present a novel algorithm for accurately detecting all contacts, including self-collisions, between deformable models. We precompute a chromatic decomposition of a mesh into non-adjacent primitives using graph coloring algorithms. The chromatic decomposition enables us to check for collisions between non-adjacent primitives using a linear-time culling algorithm. As a result, we achieve higher culling efficiency and significantly reduce the number of false positives. We use our algorithm to check for collisions among complex deformable models consisting of tens of thousands of triangles for cloth modeling and medical simulation. Our algorithm accurately computes all contacts at interactive rates. We observed up to an order of magnitude speedup over prior methods.
Naga K. Govindaraju, David Knott, Nitin Jain, Ilknur Kabul, Rasmus Tamstorf, Russell Gayle, Ming C. Lin, Dinesh Manocha
ACM Trans. Graph.2
2004 ConEditor: Tool to Input and Maintain Constraints
Suraj Ajit, Derek H. Sleeman, David W. Fowler, David Knott
EKAW4