Zobrazeno 1 - 10
of 271
pro vyhledávání: '"Gotsman, Craig"'
Autor:
Gotsman, Craig, Hormann, Kai
Contact tracing is an effective tool in controlling the spread of infectious diseases such as COVID-19. It involves digital monitoring and recording of physical proximity between people over time with a central and trusted authority, so that when one
Externí odkaz:
http://arxiv.org/abs/2008.06297
Autor:
Chen, Renjie, Gotsman, Craig
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 computation of these paths is critical for system performance and throughput.
Externí odkaz:
http://arxiv.org/abs/1812.07441
Autor:
Chen, Renjie, Gotsman, Craig
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 directed edge is weighted by a "travel time" value, are becoming a stan
Externí odkaz:
http://arxiv.org/abs/1810.01776
Given a finitely-connected bounded planar domain $\Omega$, it is possible to define a {\it divergence distance} $D(x,y)$ from $x\in\Omega$ to $y\in\Omega$, which takes into account the complex geometry of the domain. This distance function is based o
Externí odkaz:
http://arxiv.org/abs/1801.07099
Path planning is an important problem in robotics. One way to plan a path between two points $x,y$ within a (not necessarily simply-connected) planar domain $\Omega$, is to define a non-negative distance function $d(x,y)$ on $\Omega\times\Omega$ such
Externí odkaz:
http://arxiv.org/abs/1708.05855
Distance functions between points in a domain are sometimes used to automatically plan a gradient-descent path towards a given target point in the domain, avoiding obstacles that may be present. A key requirement from such distance functions is the a
Externí odkaz:
http://arxiv.org/abs/1708.02845
Polyhedral meshes (PM) - meshes having planar faces - have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate. Previous
Externí odkaz:
http://arxiv.org/abs/1303.4110
We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is a generic
Externí odkaz:
http://arxiv.org/abs/1011.5553
Publikováno v:
In Computer Aided Geometric Design November 2018 66:52-74
Autor:
Chen, Renjie, Gotsman, Craig
Publikováno v:
In Computer Aided Geometric Design May 2016 44:15-35