activity
20132021
most citedOn Linear Spaces of Polyhedral Meshes

3 citations · 7 across the 6 of their papers we have counts for

collaborators

9 papers

cs.CG2021

Mesh Total Generalized Variation for Denoising

Zheng Liu, YanLei Li, Weina Wang +2

Total Generalized Variation (TGV) has recently been proven certainly successful in image processing for preserving sharp features as well as smooth transition variations. However,…

cs.GR2019

Computational Design of Lightweight Trusses

Caigui Jiang, Chengcheng Tang, Hans-Peter Seidel +2

Trusses are load-carrying light-weight structures consisting of bars connected at joints ubiquitously applied in a variety of engineering scenarios. Designing optimal trusses that…

cs.DS2018

A Scalable Heuristic for Fastest-Path Computation on Very Large Road Maps

Renjie Chen, Craig Gotsman

Fastest-path queries between two points in a very large road map is an increasingly important primitive in modern transportation and navigation systems, thus very efficient computa…

cs.DS2018

Efficient Fastest-Path Computations in Road Maps

Renjie Chen, Craig Gotsman

In the age of real-time online traffic information and GPS-enabled devices, fastest-path computations between two points in a road network modeled as a directed graph, where each d…

math.CV20181 cited

On Divergence-based Distance Functions for Multiply-connected Domains

Renjie Chen, Craig Gotsman, Kai Hormann

Given a finitely-connected bounded planar domain , it is possible to define a {\it divergence distance} from to , which takes into account the complex ge…

cs.RO20171 cited

Practical Distance Functions for Path-Planning in Planar Domains

Renjie Chen, Craig Gotsman, Kai Hormann

Path planning is an important problem in robotics. One way to plan a path between two points within a (not necessarily simply-connected) planar domain , is to define a non…