mirror of
https://github.com/facebookresearch/pytorch3d.git
synced 2025-08-02 11:52:50 +08:00
d9f7611c4b
Summary: C++ implementation of iterative farthest point sampling. Reviewed By: jcjohnson Differential Revision: D30349887 fbshipit-source-id: d25990f857752633859fe00283e182858a870269
38 lines
992 B
Python
38 lines
992 B
Python
# Copyright (c) Facebook, Inc. and its affiliates.
|
|
# All rights reserved.
|
|
#
|
|
# This source code is licensed under the BSD-style license found in the
|
|
# LICENSE file in the root directory of this source tree.
|
|
|
|
from itertools import product
|
|
|
|
from fvcore.common.benchmark import benchmark
|
|
from test_sample_farthest_points import TestFPS
|
|
|
|
|
|
def bm_fps() -> None:
|
|
kwargs_list = []
|
|
backends = ["cpu", "cuda:0"]
|
|
Ns = [8, 32]
|
|
Ps = [64, 256]
|
|
Ds = [3]
|
|
Ks = [24]
|
|
test_cases = product(Ns, Ps, Ds, Ks, backends)
|
|
for case in test_cases:
|
|
N, P, D, K, d = case
|
|
kwargs_list.append({"N": N, "P": P, "D": D, "K": K, "device": d})
|
|
|
|
benchmark(
|
|
TestFPS.sample_farthest_points_naive,
|
|
"FPS_NAIVE_PYTHON",
|
|
kwargs_list,
|
|
warmup_iters=1,
|
|
)
|
|
|
|
kwargs_list = [k for k in kwargs_list if k["device"] == "cpu"]
|
|
benchmark(TestFPS.sample_farthest_points, "FPS_CPU", kwargs_list, warmup_iters=1)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
bm_fps()
|